796 search results - page 120 / 160 » The Anonymous Subgraph Problem |
113
click to vote
CIKM
2010
Springer
14 years 6 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
STOC
2002
ACM
16 years 5 days ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
101
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
A common objective in mechanism design is to choose the outcome (for example, allocation of resources) that maximizes the sum of the agents' valuations, without introducing in...
WDAG
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we study the exclusive perpetual exploration problem with mobile anonymous and oblivious robots in a discrete space. Our results hold for the most generic settings:...
109
click to vote
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...