Sciweavers

281 search results - page 35 / 57
» Code Compaction Using Genetic Algorithms
Sort
View
CVPR
2012
IEEE
11 years 9 months ago
Fast search in Hamming space with multi-index hashing
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision applications. Although binary codes are motivated by their ...
Mohammad Emtiyaz Norouzi, Ali Punjani, David J. Fl...
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
14 years 28 days ago
A systemic computation platform for the modelling and analysis of processes with natural characteristics
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...
Erwan Le Martelot, Peter J. Bentley, R. Beau Lotto
SIGSOFT
2007
ACM
14 years 7 months ago
Mining API patterns as partial orders from source code: from usage scenarios to specifications
A software system interacts with third-party libraries through various APIs. Using these library APIs often needs to follow certain usage patterns. Furthermore, ordering rules (sp...
Mithun Acharya, Tao Xie, Jian Pei, Jun Xu
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 7 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
CGO
2010
IEEE
14 years 1 months ago
Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code
We present a practical and scalable method for flow- and contextsensitive (FSCS) pointer analysis for C programs. Our method analyzes the pointers in a program level by level in ...
Hongtao Yu, Jingling Xue, Wei Huo, Xiaobing Feng 0...