Sciweavers

4524 search results - page 732 / 905
» The Complexity of Global Constraints
Sort
View
PODS
2003
ACM
118views Database» more  PODS 2003»
14 years 8 months ago
Numerical document queries
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
Helmut Seidl, Thomas Schwentick, Anca Muscholl
PODS
2005
ACM
129views Database» more  PODS 2005»
14 years 8 months ago
Regular rewriting of active XML and unambiguity
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
Serge Abiteboul, Tova Milo, Omar Benjelloun
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 8 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
14 years 5 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
ALT
2001
Springer
14 years 5 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...