Sciweavers

62 search results - page 11 / 13
» An Optimal and Progressive Algorithm for Skyline Queries
Sort
View
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
14 years 7 months ago
Clio grows up: from research prototype to industrial tool
Clio, the IBM Research system for expressing declarative schema mappings, has progressed in the past few years from a research prototype into a technology that is behind some of I...
Laura M. Haas, Mauricio A. Hernández, Howar...
AAAI
1998
13 years 9 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
ML
2007
ACM
108views Machine Learning» more  ML 2007»
13 years 7 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
SIGMOD
2007
ACM
120views Database» more  SIGMOD 2007»
14 years 7 months ago
Xpath on steroids: exploiting relational engines for xpath performance
A lot of research has been conducted by the database community on methods and techniques for efficient XPath processing, with great success. Despite the progress made, significant...
Haris Georgiadis, Vasilis Vassalos
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
14 years 9 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis