Sciweavers

326 search results - page 47 / 66
» The Minimum-Area Spanning Tree Problem
Sort
View
DCC
2001
IEEE
14 years 9 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
TROB
2008
112views more  TROB 2008»
13 years 9 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
COMPGEOM
2010
ACM
14 years 3 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
SMI
2005
IEEE
14 years 3 months ago
Subdomain Aware Contour Trees and Contour Evolution in Time-Dependent Scalar Fields
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
Andrzej Szymczak
NETGAMES
2006
ACM
14 years 3 months ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...