Sciweavers

1089 search results - page 83 / 218
» Randomness and Reducibility
Sort
View
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
14 years 4 months ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...
STORAGESS
2006
ACM
14 years 4 months ago
Using device diversity to protect data against batch-correlated disk failures
Batch-correlated failures result from the manifestation of a common defect in most, if not all, disk drives belonging to the same production batch. They are much less frequent tha...
Jehan-François Pâris, Darrell D. E. L...
SAC
2005
ACM
14 years 3 months ago
SVD-based collaborative filtering with privacy
Collaborative filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. Such techniques recommend products to customers using similar users...
Huseyin Polat, Wenliang Du
AP2PC
2004
Springer
14 years 3 months ago
Semantic Overlay Networks for P2P Systems
In a peer-to-peer (P2P) system, nodes typically connect to a small set of random nodes (their neighbors), and queries are propagated along these connections. Such query flooding t...
Arturo Crespo, Hector Garcia-Molina
ILP
2004
Springer
14 years 3 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik