3471 search results - page 447 / 695 » Obstacle Numbers of Graphs |
192
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
169
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
135
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
165
click to vote
IAT
2008
IEEE
16 years 1 months ago
2008
IEEE
Quantum service selection facilitates matchmaking of Web services and greatly benefits from quantum memory exponential in the number of its qubits as well as from computational s...
214
click to vote
ICRA
2007
IEEE
16 years 29 days ago
2007
IEEE
Abstract— This paper presents a solution to interactive navigation planning and real-time simulation of a very large number of entities moving in a virtual environment. From the ...