10447 search results - page 2002 / 2090 » The Philosophy of Computer Science |
108
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
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....
108
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
186
click to vote
VLDB
2004
ACM
16 years 1 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
190
click to vote
VLDB
2006
ACM
16 years 1 months ago
2006
ACM
Abstract We explore the problem of portable and flexible privacy preserving access rights that permit access to a large collection of digital goods. Privacy-preserving access contr...
182
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...