356 search results - page 67 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
PODC
2006
ACM
15 years 4 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
SIGCOMM
2006
ACM
15 years 4 months ago
2006
ACM
The Internet consists of thousands of independent domains with different, and sometimes competing, business interests. However, the current interdomain routing protocol (BGP) limi...
73
Voted
SIGECOM
2006
ACM
15 years 4 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
ISPD
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
MIR
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we propose a novel system, named Video Booklet, which enables efficient and natural personal video browsing and searching. In the system, firstly representative th...