10608 search results - page 261 / 2122 » Complexity of O'Hara's Algorithm |
TEC
2010
14 years 7 months ago
2010
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
100
click to vote
STOC
2005
ACM
16 years 25 days ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
130
Voted
DC
2008
15 years 18 days ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
104
click to vote
CSC
2008
15 years 2 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
127
click to vote
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...