674 search results - page 93 / 135 » The computational complexity of the parallel knock-out probl... |
127
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
113
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
106
click to vote
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
131
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
117
click to vote
CORR
2002
Springer
15 years 1 months ago
2002
Springer
Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always ...