432 search results - page 40 / 87 » Internally deterministic parallel algorithms can be fast |
124
click to vote
AIPS
2010
15 years 4 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
101
click to vote
AUSDM
2007
Springer
15 years 8 months ago
2007
Springer
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
109
click to vote
PR
2006
15 years 1 months ago
2006
We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It us...
116
click to vote
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
131
click to vote
FSTTCS
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...