Sciweavers

6562 search results - page 1204 / 1313
» Noetherianity and Combination Problems
Sort
View
ICALP
2009
Springer
16 years 6 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 6 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
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
16 years 6 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
SIGMOD
2008
ACM
143views Database» more  SIGMOD 2008»
16 years 6 months ago
Middleware-based database replication: the gaps between theory and practice
The need for high availability and performance in data management systems has been fueling a long running interest in database replication from both academia and industry. However...
Emmanuel Cecchet, George Candea, Anastasia Ailamak...
SIGMOD
2006
ACM
126views Database» more  SIGMOD 2006»
16 years 6 months ago
Constraint chaining: on energy-efficient continuous monitoring in sensor networks
Wireless sensor networks have created new opportunities for data collection in a variety of scenarios, such as environmental and industrial, where we expect data to be temporally ...
Adam Silberstein, Jun Yang 0001, Rebecca Braynard
« Prev « First page 1204 / 1313 Last » Next »