7930 search results - page 343 / 1586 » Greedy in Approximation Algorithms |
286
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
Modern distributed information systems cope with disconnection and limited bandwidth by using caches. In communicationconstrained situations, traditional demand-driven approaches ...
183
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
228
click to vote
STOC
2007
ACM
16 years 7 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...
189
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
291
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between...