Sciweavers

24 search results - page 5 / 5
» Voronoi game on graphs and its complexity
Sort
View
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 9 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
CVPR
2006
IEEE
14 years 7 months ago
Multi-Target Tracking - Linking Identities using Bayesian Network Inference
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
Peter Nillius, Josephine Sullivan, Stefan Carlsson
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 5 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ACSC
2010
IEEE
13 years 7 days ago
Efficient contour line labelling for terrain modelling
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
Xin Xie, Burkhard Wünsche