2996 search results - page 552 / 600 » Numberings and Randomness |
106
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
122
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
115
Voted
SDM
2009
SIAM
16 years 25 days ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
127
Voted
SDM
2009
SIAM
16 years 25 days ago
2009
SIAM
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
134
Voted
EUROSYS
2006
ACM
16 years 22 days ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...