Sciweavers

868 search results - page 44 / 174
» A general compression algorithm that supports fast searching
Sort
View
142
Voted
IJCV
2000
109views more  IJCV 2000»
15 years 3 months ago
Fast Lighting Independent Background Subtraction
This paper describes a simple method of fast background subtraction based upon disparity verification that is invariant to arbitrarily rapid run-time changes in illumination. Using...
Yuri A. Ivanov, Aaron F. Bobick, John Liu
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 4 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
158
Voted
GLVLSI
2003
IEEE
129views VLSI» more  GLVLSI 2003»
15 years 9 months ago
A system-level methodology for fast multi-objective design space exploration
In this paper, we address the problem of the efficient exploration of the architectural design space for parameterized systems. Since the design space is multi-objective, our aim ...
Gianluca Palermo, Cristina Silvano, S. Valsecchi, ...
116
Voted
JETAI
2007
141views more  JETAI 2007»
15 years 3 months ago
Exchange market for complex commodities: search for optimal matches
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
Eugene Fink, Jianli Gong, Josh Johnson
ATAL
2009
Springer
15 years 10 months ago
Caching schemes for DCOP search algorithms
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
William Yeoh, Pradeep Varakantham, Sven Koenig