Sciweavers

684 search results - page 85 / 137
» A characterization of b-perfect graphs
Sort
View
COSIT
2009
Springer
116views GIS» more  COSIT 2009»
15 years 6 months ago
The Endpoint Hypothesis: A Topological-Cognitive Assessment of Geographic Scale Movement Patterns
Movement patterns of individual entities at the geographic scale are becoming a prominent research focus in spatial sciences. One pertinent question is how cognitive and formal cha...
Alexander Klippel, Rui Li
NC
2010
137views Neural Networks» more  NC 2010»
14 years 6 months ago
On the regularity of circular splicing languages: a survey and new developments
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focu...
Paola Bonizzoni, Clelia de Felice, Gabriele Fici, ...
DM
2002
186views more  DM 2002»
14 years 11 months ago
Coloring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
Bojan Mohar
ICCV
2009
IEEE
1655views Computer Vision» more  ICCV 2009»
16 years 4 months ago
Shift-Map Image Editing
Geometric rearrangement of images includes operations such as image retargeting, inpainting, or object rearrangement. Each such operation can be characterized by a shiftmap: the...
Yael Pritch, Eitam Kav-Venaki, Shmuel Peleg
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 4 days ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan