Sciweavers

6393 search results - page 193 / 1279
» Randomized Algorithms on the Mesh
Sort
View
TOG
2002
119views more  TOG 2002»
15 years 3 months ago
Interactive geometry remeshing
We present a novel technique, both flexible and efficient, for interactive remeshing of irregular geometry. First, the original (arbitrary genus) mesh is substituted by a series o...
Pierre Alliez, Mark Meyer, Mathieu Desbrun
MOBICOM
2005
ACM
15 years 9 months ago
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are chara...
Murali S. Kodialam, Thyaga Nandagopal
LCN
2005
IEEE
15 years 9 months ago
Constructing Efficient Multi-hop Mesh Networks
The Wireless Channel-oriented Ad-hoc Multi-hop Broadband (W-CHAMB) is a new link layer protocol with the aim of being able to support Quality of Service (QoS) in multi-hop operati...
Rui Zhao, Bernhard Walke, Michael Einhaus
SPAA
2010
ACM
15 years 9 months ago
Multi-sided shared coins and randomized set-agreement
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
Keren Censor Hillel
TIP
2008
124views more  TIP 2008»
15 years 4 months ago
Graph Laplacian Tomography From Unknown Random Projections
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...
Ronald R. Coifman, Yoel Shkolnisky, Fred J. Sigwor...