Sciweavers

225 search results - page 32 / 45
» Explicit Combinatorial Structures for Cooperative Distribute...
Sort
View
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 3 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
11 years 11 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
HIPC
2007
Springer
14 years 26 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
INFOCOM
2009
IEEE
14 years 3 months ago
Minimizing Average Finish Time in P2P Networks
—Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. For a P2P network, one fundamental performance metric is the average time need...
G. Matthew Ezovski, Ao Tang, Lachlan L. H. Andrew
UAI
2003
13 years 10 months ago
Learning Module Networks
Methods for learning Bayesian networks can discover dependency structure between observed variables. Although these methods are useful in many applications, they run into computat...
Eran Segal, Dana Pe'er, Aviv Regev, Daphne Koller,...