10608 search results - page 579 / 2122 » Complexity of O'Hara's Algorithm |
147
click to vote
WIA
2005
Springer
16 years 18 days ago
2005
Springer
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
213
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
194
Voted
DIALM
2008
ACM
15 years 9 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
321
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
225
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...