1331 search results - page 57 / 267 » Complexity bounds for zero-test algorithms |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
AIPS
2008
13 years 10 months ago
2008
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...