Sciweavers

2745 search results - page 339 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ICCV
2009
IEEE
1824views Computer Vision» more  ICCV 2009»
16 years 11 months ago
Beyond the Euclidean distance: Creating effective visual codebooks using the histogram intersection kernel
Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the Euclidean distance to cluster features into visual...
Jianxin Wu, James M. Rehg
CVPR
2008
IEEE
16 years 8 months ago
Optical flow estimation with uncertainties through dynamic MRFs
In this paper, we propose a novel dynamic discrete framework to address image morphing with application to optical flow estimation. We reformulate the problem using a number of di...
Ben Glocker, Nikos Paragios, Nikos Komodakis, Geor...
STACS
2007
Springer
16 years 8 days ago
On Fixed Point Equations over Commutative Semirings
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
FOCS
1989
IEEE
15 years 10 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....