Sciweavers

3082 search results - page 596 / 617
» New Bounds for the Controller Problem
Sort
View
WWW
2007
ACM
16 years 4 months ago
Discovering the best web service
Major research challenges in discovering Web services include, provisioning of services across multiple or heterogeneous registries, differentiating between services that share si...
Eyhab Al-Masri, Qusay H. Mahmoud
144
Voted
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 4 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
CHI
2001
ACM
16 years 4 months ago
Listen reader: an electronically augmented paper-based book
While predictions abound that electronic books will supplant traditional paper-based books, many people bemoan the coming loss of the book as cultural artifact. In this project we...
Maribeth Back, Jonathan Cohen, Rich Gold, Steve R....
VLDB
2009
ACM
147views Database» more  VLDB 2009»
16 years 4 months ago
Privacy-preserving indexing of documents on the network
We address the problem of providing privacypreserving search over distributed accesscontrolled content. Indexed documents can be easily reconstructed from conventional (inverted) ...
Mayank Bawa, Rakesh Agrawal, Roberto J. Bayardo Jr...
254
Voted
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 4 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis