Sciweavers

923 search results - page 98 / 185
» On the Topology of Discrete Strategies
Sort
View
TSMC
1998
78views more  TSMC 1998»
13 years 8 months ago
Automata learning and intelligent tertiary searching for stochastic point location
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
B. John Oommen, Govindachari Raghunath
PODC
2009
ACM
14 years 9 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
PODC
2005
ACM
14 years 2 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
COMPGEOM
2010
ACM
14 years 2 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
TOG
2008
239views more  TOG 2008»
13 years 9 months ago
Skeleton extraction by mesh contraction
eleton is a very useful 1D structure to abstract the geometry and topology of a 3D object. Extraction of curve-skeletons is a fundamental problem in computer graphics, visualizatio...
Oscar Kin-Chung Au, Chiew-Lan Tai, Hung-Kuo Chu, D...