Sciweavers

3220 search results - page 166 / 644
» Constrained Graph Processes
Sort
View
PAMI
1998
92views more  PAMI 1998»
15 years 6 months ago
INFORMys: A Flexible Invoice-Like Form-Reader System
—In this paper, we describe a flexible form-reader system capable of extracting textual information from accounting documents, like invoices and bills of service companies. In th...
Francesca Cesarini, Marco Gori, Simone Marinai, Gi...
ICCV
2011
IEEE
14 years 6 months ago
Image Segmentation by Figure-Ground Composition into Maximal Cliques
We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and s...
Adrian Ion, Joao Carreira, Cristian Sminchisescu
DAC
2006
ACM
16 years 7 months ago
Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...
Sander Stuijk, Marc Geilen, Twan Basten
CVPR
2010
IEEE
16 years 2 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
CAAN
2007
Springer
16 years 17 days ago
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
Margaret-Ellen Messinger, Pawel Pralat, Richard J....