Sciweavers

1272 search results - page 180 / 255
» Approximate Parameterized Matching
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Surfing the Blogosphere: Optimal Personalized Strategies for Searching the Web
We propose a distributed mechanism for finding websurfing strategies that is inspired by the StumbleUpon recommendation engine. Each day, a websurfer visits a sequence of websites ...
Stratis Ioannidis, Laurent Massoulié
CVIU
2011
15 years 1 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
CVPR
2012
IEEE
13 years 8 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
ICML
2008
IEEE
16 years 7 months ago
Modified MMI/MPE: a direct evaluation of the margin in speech recognition
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
Georg Heigold, Hermann Ney, Ralf Schlüter, Th...
POPL
2010
ACM
16 years 3 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...