1469 search results - page 290 / 294 » Characterizing the Structural Complexity of Real-World Compl... |
145
click to vote
STOC
2007
ACM
15 years 12 months 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...
120
click to vote
PODS
2008
ACM
15 years 11 months ago
2008
ACM
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
86
Voted
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
CSFW
2007
IEEE
15 years 6 months ago
2007
IEEE
mplementations for Typed Session Abstractions Ricardo Corin1,2,3 Pierre-Malo Deni´elou1,2 C´edric Fournet1,2 Karthikeyan Bhargavan1,2 James Leifer1 1 MSR-INRIA Joint Centre 2 Mic...
110
click to vote
HICSS
2005
IEEE
15 years 5 months ago
2005
IEEE
As we progress, society must intelligently address the following question: How much risk is acceptable? How we answer this question could have important consequences for the futur...