Sciweavers

333 search results - page 52 / 67
» Speeding up moving-target search
Sort
View
85
Voted
DAC
1999
ACM
15 years 2 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
ICMCS
1999
IEEE
119views Multimedia» more  ICMCS 1999»
15 years 2 months ago
Indexing by Shape of Image Databases Based on Extended Grid Files
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...
Carlo Combi, Gian Luca Foresti, Massimo Francesche...
88
Voted
IPPS
1998
IEEE
15 years 2 months ago
Locality Optimization for Program Instances
Abstract. The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs ...
Claudia Leopold
CIVR
2006
Springer
114views Image Analysis» more  CIVR 2006»
15 years 1 months ago
Keyframe Retrieval by Keypoints: Can Point-to-Point Matching Help?
Abstract. Bag-of-words representation with visual keypoints has recently emerged as an attractive approach for video search. In this paper, we study the degree of improvement when ...
Wanlei Zhao, Yu-Gang Jiang, Chong-Wah Ngo
78
Voted
GECCO
2006
Springer
253views Optimization» more  GECCO 2006»
15 years 1 months ago
A novel approach to optimize clone refactoring activity
Achieving a high quality and cost-effective tests is a major concern for software buyers and sellers. Using tools and integrating techniques to carry out low cost testing are chal...
Salah Bouktif, Giuliano Antoniol, Ettore Merlo, Ma...