2374 search results - page 159 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
111
click to vote
VLDB
2001
ACM
15 years 7 months ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
111
Voted
CCS
2005
ACM
15 years 8 months ago
2005
ACM
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
124
Voted
ICS
2010
Tsinghua U.
15 years 12 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
107
click to vote
NIPS
2003
15 years 3 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
124
click to vote
DAC
2008
ACM
16 years 3 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...