79 search results - page 15 / 16 » Randomized Competitive Algorithms for Generalized Caching |
CP
2008
Springer
13 years 6 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
ICIP
1999
IEEE
13 years 9 months ago
1999
IEEE
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
MOBIHOC
2004
ACM
13 years 10 months ago
2004
ACM
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...
SIGGRAPH
1997
ACM
13 years 9 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...