2485 search results - page 277 / 497 » Time Bounded Frequency Computations |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
FOCS
1998
IEEE
14 years 15 days ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
ICDCS
2007
IEEE
14 years 3 days ago
2007
IEEE
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amo...
VMV
2000
13 years 9 months ago
2000
Direct volume rendering is a common means of visualizing three-dimensional data nowadays. It is, however, still a very time consuming process to create informative and visual appe...