Sciweavers

1605 search results - page 161 / 321
» On Partitional Labelings of Graphs
Sort
View
CCCG
2009
13 years 11 months ago
Colored Simultaneous Geometric Embeddings and Universal Pointsets
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
ICIP
1998
IEEE
14 years 2 months ago
Video Object Segmentation Introducing Depth and Motion Information
In the paper we present a method to estimate relative depth between objects in scenes of video sequences. The information for the estimation of the relative depth is obtained from...
Montse Pardàs
DIAL
2004
IEEE
170views Image Analysis» more  DIAL 2004»
14 years 2 months ago
Document Style Census for OCR
Four methods of converting paper documents to computer-readable form are compared with regard to hypothetical labor cost: keyboarding, omnifont OCR, stylespecific OCR, and style-c...
George Nagy, Prateek Sarkar
FOSSACS
2009
Springer
14 years 5 months ago
Separating Graph Logic from MSO
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...
Timos Antonopoulos, Anuj Dawar
GG
2004
Springer
14 years 3 months ago
Representing First-Order Logic Using Graphs
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
Arend Rensink