2485 search results - page 277 / 497 » Time Bounded Frequency Computations |
124
click to vote
PODC
2009
ACM
16 years 3 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...
124
click to vote
ICALP
2005
Springer
15 years 8 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...
140
click to vote
FOCS
1998
IEEE
15 years 7 months 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...
136
click to vote
ICDCS
2007
IEEE
15 years 7 months 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...
159
click to vote
VMV
2000
15 years 4 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...