2137 search results - page 374 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
129
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
142
click to vote
SIGGRAPH
1992
ACM
15 years 6 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
133
Voted
JCO
2006
15 years 2 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
123
click to vote
DCC
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...
122
Voted
ACCV
2006
Springer
15 years 8 months ago
2006
Springer
This paper proposes an appearance generative mixture model based on key frames for meanshift tracking. Meanshift tracking algorithm tracks object by maximizing the similarity betwe...