Sciweavers

281 search results - page 39 / 57
» Toward Practical Constraint Databases
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 8 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
SIGMOD
2003
ACM
88views Database» more  SIGMOD 2003»
14 years 8 months ago
Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues
We consider the problem of mapping data in peer-topeer data-sharing systems. Such systems often rely on the use of mapping tables listing pairs of corresponding values to search f...
Anastasios Kementsietsidis, Marcelo Arenas, Ren&ea...
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 12 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
MOBIHOC
2010
ACM
13 years 6 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen