2069 search results - page 165 / 414 » Linear time algorithms for Clobber |
161
Voted
DBPL
2007
Springer
15 years 8 months ago
2007
Springer
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
115
click to vote
SDM
2010
SIAM
15 years 6 months ago
2010
SIAM
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
138
click to vote
FIMI
2004
15 years 6 months ago
2004
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
157
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
140
Voted
PVM
1999
Springer
15 years 8 months ago
1999
Springer
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...