Sciweavers

1101 search results - page 125 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
TROB
2008
112views more  TROB 2008»
15 years 4 months ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 7 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
INFOCOM
2008
IEEE
15 years 11 months ago
Distributed Operator Placement and Data Caching in Large-Scale Sensor Networks
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
Lei Ying, Zhen Liu, Donald F. Towsley, Cathy H. Xi...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 9 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
141
Voted
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
15 years 11 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...