Sciweavers

10088 search results - page 1916 / 2018
» Queries and Computation on the Web
Sort
View
FOCS
2002
IEEE
14 years 2 months ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 2 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
14 years 2 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
MM
2009
ACM
187views Multimedia» more  MM 2009»
14 years 1 months ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...
SAC
1997
ACM
14 years 1 months ago
The RasDaMan approach to multidimensional database management
Multidimensional discrete data (MDD), i.e., arrays of arbitrary size, dimension, and base type, are receiving growing attention among the database community. MDD occur in a variet...
Peter Baumann, Paula Furtado, Roland Ritsch, Norbe...
« Prev « First page 1916 / 2018 Last » Next »