205 search results - page 13 / 41 » Engineering Planar Separator Algorithms |
ICS
2005
Tsinghua U.
15 years 3 months ago
2005
Tsinghua U.
As network traffic continues to increase and with the requirement to process packets at line rates, high performance routers need to forward millions of packets every second. Eve...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Determining the user intent of Web searches is a difficult problem due to the sparse data available concerning the searcher. In this paper, we examine a method to determine the us...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
115
click to vote
WOSP
2004
ACM
15 years 2 months ago
2004
ACM
This paper analyzes the performability of client-server applications that use a separate fault management architecture for monitoring and controlling of the status of the applicat...
88
Voted
SIAMCOMP
2008
14 years 9 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...