558 search results - page 43 / 112 » Trees and Matchings |
111
click to vote
SIBGRAPI
1999
IEEE
15 years 4 months ago
1999
IEEE
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
114
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
107
click to vote
NBIS
2007
Springer
15 years 6 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
112
click to vote
IANDC
2011
14 years 6 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...