Sciweavers

450 search results - page 12 / 90
» Estimating Search Tree Size
Sort
View
CVIU
2011
13 years 3 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
JFP
2006
67views more  JFP 2006»
13 years 8 months ago
Finger trees: a simple general-purpose data structure
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...
Ralf Hinze, Ross Paterson
ICIP
2004
IEEE
14 years 10 months ago
Fast full search block motion estimation for H.264/AVC with multilevel successive elimination algorithm
We modify the multilevel successive elimination algorithm (MSEA) to make it compatible with the motion estimation required for the H.264/AVC video coding standard. The algorithm m...
Janne Heikkilä, Tuukka Toivonen
OPODIS
2008
13 years 10 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 10 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian