400 search results - page 47 / 80 » Lower Bounds Using Kolmogorov Complexity |
118
click to vote
ICCAD
2010
IEEE
14 years 11 months ago
2010
IEEE
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...
132
click to vote
MST
2011
14 years 8 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
122
Voted
JGAA
2006
15 years 1 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
131
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
135
click to vote
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...