Sciweavers

1024 search results - page 71 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
CVPR
1998
IEEE
15 years 12 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih
SMA
1997
ACM
120views Solid Modeling» more  SMA 1997»
15 years 2 months ago
The Generic Geometric Complex (GGC): A Modeling Scheme for Families of Decomposed Pointsets
: Modeling of families of geometric objects is a major topic in modern geometric and solid modeling. Object families are central to many important solid modeling applications, incl...
Ari Rappoport
KDD
2010
ACM
228views Data Mining» more  KDD 2010»
15 years 1 months ago
The new iris data: modular data generators
In this paper we introduce a modular, highly flexible, opensource environment for data generation. Using an existing graphical data flow tool, the user can combine various types...
Iris Adä, Michael R. Berthold
DLS
2008
213views Languages» more  DLS 2008»
14 years 11 months ago
A parsing machine for PEGs
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
Sérgio Medeiros, Roberto Ierusalimschy
CORR
2006
Springer
90views Education» more  CORR 2006»
14 years 10 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil