15,678 Hits in 4.8 sec

Towards In-network Compact Representation: Mergeable Counting Bloom Filter vis Cuckoo Scheduling

Wenjing Liu, Zhiwei Xu, Jie Tian, Yujun Zhang
2021 IEEE Access  
IN-NETWORK COMPACT REPRESENTATION Towards efficient and lightweight data pre-processing and analyzing at the resource-limited edge nodes, we propose an in-network compact representation scheme for a general  ...  Among other types of data compact representation algorithms, only quotient filter [20] and its variant [21] can support the merging operation, which however facilitates the hash table-based data representation  ... 
doi:10.1109/access.2021.3070982 fatcat:44rlpg7oz5glznvelzhu2nqtva

Investigating modern layout representations for improved 3d design automation

Robert Fischbach, Jens Lienig, Johann Knechtel
2011 Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI - GLSVLSI '11  
Thus, we also provide guidelines for designing efficient layout representations.  ...  The current trend towards 3D integration requires new layout representations specifically designed to take 3D-specific constraints into account and to facilitate efficient design algorithms.  ...  GUIDELINES & TOOL Summarizing our investigations, we provide the following conclusions that can be used as guidelines for development and application of future 3D representations. • Efficient 3D layout  ... 
doi:10.1145/1973009.1973076 dblp:conf/glvlsi/FischbachLK11 fatcat:6ccxlb5b65dabkztzvfitrqxci

Frequent Pattern Mining Algorithms Analysis

Ritesh Giri, Ananta Bhatt, Aadhya Bhatt
2016 International Journal of Computer Applications  
Most of the tree based structure allows efficient mining with single scan over the database. In this paper, we describe the formatting guidelines for IJCA Journal Submission.  ...  Many tree based structures have been proposed to represent the data for efficient pattern discovery including FP-Tree, CAT-Tree, CAN-Tree, CP-Tree, and etc.  ...  FP-Growth algorithm is efficient and scalable for mining both long and short frequent patterns. It is faster than the Apriori algorithm.  ... 
doi:10.5120/ijca2016910763 fatcat:3j6qlbksmbaflfcfkg2l4ipila

Binarizing MobileNet via Evolution-based Searching [article]

Hai Phan, Zechun Liu, Dang Huynh, Marios Savvides, Kwang-Ting Cheng, Zhiqiang Shen
2020 arXiv   pre-print
Second, to find a good set of hyperparameters for group convolutions we make use of the evolutionary search which leverages the exploration of efficient 1-bit models.  ...  Various experiments on ImageNet are conducted to show that following our construction guideline, the final model achieves 60.09% Top-1 accuracy and outperforms the state-of-the-art CI-BCNN with the same  ...  We thanks all anonymous reviewers for constructive and valuable feedback. The code will be available at link  ... 
arXiv:2005.06305v2 fatcat:wqpnfyedt5ey7fztndu5atdhfq

Developer-centred interface design for computer vision

Gregor Miller, Sidney Fels
2011 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)  
Our key guideline states that developer interfaces to computer vision must hide details regarding specific algorithms, and we discuss the implications of frameworks which support this guideline.  ...  The guidelines were developed through examination of previous work in computer vision and human-computer interaction, analysis of vision problems and inspiration from successful abstractions in other fields  ...  Acknowledgements We gratefully acknowledge the support of NSERC, Bell Canada, GRAND NCE, Vidigami Media Inc. and Avigilon Corporation.  ... 
doi:10.1109/iccvw.2011.6130274 dblp:conf/iccvw/MillerF11 fatcat:4qbslelzkbb6hn6nexwxghkok4

Compact projection: Simple and efficient near neighbor search with practical memory requirements

Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-Sheng Hua, Yi Ma
2010 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition  
Efficient similarity search across large image databases depends critically on the availability of compact image representations and good data structures for indexing them.  ...  We present a very simple algorithm for generating compact binary representations of imagery data, based on random projections.  ...  In this paper, we study a very simple algorithm for generating compact binary representations of a given image database. Like LSH, our algorithm is based on random projections.  ... 
doi:10.1109/cvpr.2010.5539973 dblp:conf/cvpr/MinYWWHM10 fatcat:4pnenpygrzavnlbvp33ukz7qd4

Using Compact Coevolutionary Algorithm for Matching Biomedical Ontologies

Xingsi Xue, Jie Chen, Junfeng Chen, Dongxu Chen
2018 Computational Intelligence and Neuroscience  
To overcome these shortcomings, we propose a compact CoEvolutionary Algorithm to efficiently match the biomedical ontologies.  ...  Over the recent years, ontologies are widely used in various domains such as medical records annotation, medical knowledge representation and sharing, clinical guideline management, and medical decision-making  ...  In this sense, this variation operator can be considered fairly exploitative. Pseudocode of Compact Coevolutionary Algorithm.  ... 
doi:10.1155/2018/2309587 pmid:30405706 pmcid:PMC6199880 fatcat:3banmvgle5gzhputmvdd3tgfee

Time Granularities and Ultimately Periodic Automata [chapter]

Davide Bresolin, Angelo Montanari, Gabriele Puppis
2004 Lecture Notes in Computer Science  
In this paper, we focus our attention on the automaton-based one, which allows one to represent a large class of granularities in a compact and suitable to algorithmic manipulation form.  ...  The relevance of the problem of managing periodic phenomena is widely recognized in the area of knowledge representation and reasoning.  ...  compact representations of granularities.  ... 
doi:10.1007/978-3-540-30227-8_43 fatcat:wtphljtfyreina5aqzdfniugd4

Towards an implicit treatment of periodically-repeated medical data

Bela Stantic, Paolo Terenziani, Abdul Sattar, Alessio Bottrighi, Guido Governatori
2010 Studies in Health Technology and Informatics  
Then, we identify some important types of temporal queries, and present query answering algorithms to answer them. We also sketch a temporal relational algebra for our approach.  ...  We propose a new data model, representing periodic data in a compact (implicit) way, which is a consistent extension of TSQL2 consensus approach.  ...  We propose a new methodology based on an implicit representation, and on efficient query answering algorithms.  ... 
pmid:20841860 fatcat:flaune3arvartbuqdo547cfy4e

Rule set reduction using augmented decision table and semantic subsumption techniques: application to cholesterol guidelines

R N Shiffman, R A Greenes
1992 Proceedings. Symposium on Computer Applications in Medical Care  
Subsumption techniques proved superior for compacting a large rule set based on risk factors.  ...  Clinical practice guidelines must comprehensively address all logically possible situations, but this completeness may result in sizable and cumbersome rule sets.  ...  Acknowledgment The authors thank David Eddy for making his data available for this analysis. Thanks also to William Woods and Peter Szolovits for their valuable comments.  ... 
pmid:1482893 pmcid:PMC2248051 fatcat:4r5m6e3n6fhq3ie5zc6v7eniau

On-line arithmetic for real-time control of microsystems

M. Dimmler, A. Tisserand, U. Holmbeg, R. Longchamp
1999 IEEE/ASME transactions on mechatronics  
Nowadays, on-line algorithms are available for all common arithmetic operations, in the fixed-point representation, as well as in the floating-point representation, but they have been rarely used in hardware  ...  Some guidelines for their control-specific implementation have been presented and verified for a simple implementation example.  ... 
doi:10.1109/3516.769548 fatcat:sizdkhbnwrf4xjrrwj6iipl4jy

Abstracts of Recent PhDs

2010 Knowledge engineering review (Print)  
An important goal of inductive learning is to generate accurate and compact classifiers from data.  ...  First, abstraction is aimed at the design and analysis of algorithms that generate and deal with taxonomies for the construction of compact and robust classifiers.  ...  This thesis makes four main contributions: (1) an efficient and robust technique for formation identification based on spatial relationships; (2) a new algorithm for simultaneously determining team membership  ... 
doi:10.1017/s0269888910000226 fatcat:rbhe2vtt4vburdupv7cjioqg4y

Compact Similarity Joins

Brent Bryan, Frederick Eberhardt, Christos Faloutsos
2008 2008 IEEE 24th International Conference on Data Engineering  
We solve this problem by providing two algorithms that find a compact representation of the similarity join result, while retaining all the information in the standard join.  ...  Experiments on real and realistic point-sets show that our algorithms are up to several orders of magnitude faster.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation, or other funding  ... 
doi:10.1109/icde.2008.4497443 dblp:conf/icde/BryanEF08 fatcat:t5w6lv2mnfe2die6lkyss2qixy

A parallel spatiotemporal saliency and discriminative online learning method for visual target tracking in aerial videos

Amirhossein Aghamohammadi, Mei Choo Ang, Elankovan A. Sundararajan, Ng Kok Weng, Marzieh Mogharrebi, Seyed Yashar Banihashem, Sambit Bakshi
2018 PLoS ONE  
SLIC superpixel segmentation, color, and moment features can be used to compute feature uniqueness and spatial compactness of saliency measurements to detect spatial saliency.  ...  Experiments conducted on the VIVID dataset demonstrated that the proposed visual tracking method is effective and is computationally efficient compared to state-of-the-art methods.  ...  Seyed Mostafa Mousavi Kahaki for useful advices and suggestions. We would also like to thank the anonymous reviewers for their useful that resulted in the improvements to this paper.  ... 
doi:10.1371/journal.pone.0192246 pmid:29438421 pmcid:PMC5811006 fatcat:6ejiytqguvct5nyiznjdnpstc4

Genetic algorithms with fuzzy fitness function for object extraction using cellular networks

Sankar K. Pal, Dinabandhu Bhadari
1994 Fuzzy sets and systems (Print)  
The proposed method relieves the CNN from using heuristics for the template selection procedure, and performs consistently well in noisy environments.  ...  The present paper provides a methodology, demonstrating the capability of Genetic Algorithms with a fuzzy fitness function, for automatic selection of cloning templates when a CNN is used in extracting  ...  The guidelines for selection of T for some operations like noise removal, edge detection and line detection are mentioned in [2] .  ... 
doi:10.1016/0165-0114(94)90017-5 fatcat:mtc5stsq2baenkz3rb7op65o7e
« Previous Showing results 1 — 15 out of 15,678 results