Sciweavers

2514 search results - page 111 / 503
» On the Computation of Approximations of Database Queries
Sort
View
TCSV
2008
195views more  TCSV 2008»
15 years 6 months ago
Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
Yun Fu, Zhu Li, Junsong Yuan, Ying Wu, Thomas S. H...
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 6 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
SG
2004
Springer
15 years 11 months ago
Tangible Image Query
This paper introduces a tangible user interface for browsing and retrieving images from an image database. The basis for the query to the image database is a color layout sketch, ...
Kresimir Matkovic, Thomas Psik, Ina Wagner, Werner...
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
15 years 11 months ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya
ICDE
2008
IEEE
116views Database» more  ICDE 2008»
16 years 7 months ago
Network-Aware Join Processing in Global-Scale Database Federations
Abstract-- We introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation....
Xiaodan Wang, Randal C. Burns, Andreas Terzis, Amo...