1982 search results - page 340 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
188
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
253
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm ...
160
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
190
click to vote
CIVR
2007
Springer
16 years 11 days ago
2007
Springer
Near-duplicate keyframes (NDK) play a unique role in large-scale video search, news topic detection and tracking. In this paper, we propose a novel NDK retrieval approach by explo...
399
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
The problem of recognizing actions in realistic videos
is challenging yet absorbing owing to its great potentials
in many practical applications. Most previous research is
limit...