Sciweavers

1612 search results - page 159 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
13 years 7 months ago
Analyzing graph structure via linear measurements
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor
178
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R....
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 14 hour ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
SAC
2008
ACM
15 years 4 months ago
A biologically inspired generation of virtual characters
A number of techniques for generating geometric models of human head and body are in use nowadays. Models of human characters are useful in computer games, virtual reality, and ma...
Roberto C. Cavalcante Vieira, Creto Augusto Vidal,...
171
Voted
TPDS
2008
157views more  TPDS 2008»
15 years 5 months ago
Distributed Localization Using a Moving Beacon in Wireless Sensor Networks
The localization of sensor nodes is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can acquire...
Bin Xiao, Hekang Chen, Shuigeng Zhou