564 search results - page 67 / 113 » Approximation algorithms for restricted Bayesian network str... |
105
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
157
Voted
STOC
2007
ACM
16 years 27 days ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
104
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive w...
147
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
128
Voted
HIPC
2007
Springer
15 years 4 months ago
2007
Springer
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...