Sciweavers

1007 search results - page 67 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
CP
2005
Springer
15 years 8 months ago
Parallel Local Search in Comet
Abstract. The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To...
Laurent Michel, Pascal Van Hentenryck
ICIP
2003
IEEE
16 years 4 months ago
Performance evaluation of Euclidean/correlation-based relevance feedback algorithms in content-based image retrieval systems
In this paper, we evaluate and investigate two main types of relevance feedback algorithms; the Euclidean and the correlation?based approaches. In the first case, we examine heuri...
Anastasios D. Doulamis, Nikolaos D. Doulamis
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
16 years 3 months ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...
PODS
2010
ACM
306views Database» more  PODS 2010»
15 years 8 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
PPDP
2010
Springer
15 years 1 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...