Sciweavers

199 search results - page 38 / 40
» Fast Algorithms for Computing Tree LCS
Sort
View
216
Voted
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
16 years 25 days ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
200
Voted
ICNP
2007
IEEE
16 years 1 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
219
Voted
CVPR
2007
IEEE
16 years 9 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
234
Voted
ICCV
2005
IEEE
16 years 27 days ago
Object Categorization by Learned Universal Visual Dictionary
This paper presents a new algorithm for the automatic recognition of object classes from images (categorization). Compact and yet discriminative appearance-based object class mode...
John M. Winn, Antonio Criminisi, Thomas P. Minka
CLUSTER
2008
IEEE
15 years 9 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...