3415 search results - page 634 / 683 » Lower Bounds for Kernelizations |
121
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
127
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
120
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
209
Voted
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
106
Voted
SIGSOFT
2004
ACM
16 years 1 months ago
2004
ACM
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners have adopted techniques that support increment...