Sciweavers

6393 search results - page 209 / 1279
» Randomized Algorithms on the Mesh
Sort
View
MP
2010
119views more  MP 2010»
15 years 2 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...
CGF
2008
108views more  CGF 2008»
15 years 4 months ago
Robust and Efficient Wave Simulations on Deforming Meshes
The goal of this paper is to enable the interactive simulation of phenomena such as animated fluid characters. While full 3D fluid solvers achieve this with control algorithms, th...
Roland Angst, Nils Thürey, Mario Botsch, Mark...
INFOCOM
2011
IEEE
14 years 7 months ago
A high-throughput routing metric for reliable multicast in multi-rate wireless mesh networks
Abstract—We propose a routing metric for enabling highthroughput reliable multicast in multi-rate wireless mesh networks. This new multicast routing metric, called expected multi...
Xin Zhao, Jun Guo, Chun Tung Chou, Archan Misra, S...
136
Voted
FUIN
2002
109views more  FUIN 2002»
15 years 3 months ago
Another Example of Higher Order Randomness
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability
Verónica Becher, Gregory J. Chaitin
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
15 years 8 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale