Sciweavers

5138 search results - page 232 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ICC
2007
IEEE
142views Communications» more  ICC 2007»
16 years 25 days ago
On MAC Scheduling and Packet Combination Strategies for Practical Random Network Coding
— The present paper investigates practical algorithms to efficiently exploit random network coding for data delivery in multi-hop wireless networks. In the past few years, a gre...
Elena Fasolo, Michele Rossi, Jörg Widmer, Mic...
INFOCOM
2007
IEEE
16 years 24 days ago
Multiple-Choice Random Network for Server Load Balancing
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
Ye Xia, Alin Dobra, Seung Chul Han
IROS
2007
IEEE
158views Robotics» more  IROS 2007»
16 years 24 days ago
Feature selection in conditional random fields for activity recognition
Abstract— Temporal classification, such as activity recognition, is a key component for creating intelligent robot systems. In the case of robots, classification algorithms mus...
Douglas L. Vail, John D. Lafferty, Manuela M. Velo...
SP
2006
IEEE
193views Security Privacy» more  SP 2006»
16 years 15 days ago
Analysis of the Linux Random Number Generator
Linux is the most popular open source project. The Linux random number generator is part of the kernel of all Linux distributions and is based on generating randomness from entrop...
Zvi Gutterman, Benny Pinkas, Tzachy Reinman
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 13 days ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden