Sciweavers

1321 search results - page 218 / 265
» Quadratic forms on graphs
Sort
View
PLDI
2004
ACM
14 years 1 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
CSL
2004
Springer
14 years 1 months ago
Moving in a Crumbling Network: The Balanced Case
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...
Philipp Rohde
IWCM
2004
Springer
14 years 1 months ago
Tracking Complex Objects Using Graphical Object Models
We present a probabilistic framework for component-based automatic detection and tracking of objects in video. We represent objects as spatio-temporal two-layer graphical models, w...
Leonid Sigal, Ying Zhu, Dorin Comaniciu, Michael J...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 1 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
ICDAR
2003
IEEE
14 years 29 days ago
Extraction, layout analysis and classification of diagrams in PDF documents
Diagrams are a critical part of virtually all scientific and technical documents. Analyzing diagrams will be important for building comprehensive document retrieval systems. This ...
Robert P. Futrelle, Mingyan Shao, Chris Cieslik, A...