248 search results - page 30 / 50 » New On-Line Algorithms for the Page Replication Problem |
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this...
110
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network ...
174
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract-- Many popular Web sites suffer occasional uservisible problems such as slow responses, blank pages or error messages being displayed, items not being added to shopping ca...
108
click to vote
PODC
2006
ACM
15 years 5 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...
CICLING
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Automated language identification of written text is a wellestablished research domain that has received considerable attention in the past. By now, efficient and effecti...