Sciweavers

3341 search results - page 584 / 669
» On Bounded Queries and Approximation
Sort
View
AAAI
2012
13 years 7 days ago
Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
Akshat Kumar, XiaoJian Wu, Shlomo Zilberstein
ICIP
2008
IEEE
15 years 11 months ago
Fast adaptive Mahalanobis distance-based search and retrieval in image databases
Motivated by the need to efficiently leverage user relevance feedback in content-based retrieval from image databases, we propose a fast, clustering-based indexing technique for e...
Sharadh Ramaswamy, Kenneth Rose
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
15 years 11 months ago
Super-Scalar RAM-CPU Cache Compression
High-performance data-intensive query processing tasks like OLAP, data mining or scientific data analysis can be severely I/O bound, even when high-end RAID storage systems are us...
Marcin Zukowski, Niels Nes, Peter A. Boncz, S&aacu...
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
15 years 11 months ago
Bypass Caching: Making Scientific Databases Good Network Citizens
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...
Tanu Malik, Randal C. Burns, Amitabh Chaudhary
ICPR
2000
IEEE
15 years 11 months ago
Winner-Update Algorithm for Nearest Neighbor Search
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh