Sciweavers

112 search results - page 10 / 23
» An edge colouring of multigraphs
Sort
View
CVPR
1999
IEEE
14 years 12 months ago
Fundamental Bounds on Edge Detection: An Information Theoretic Evaluation of Different Edge Cues
We treat the problem of edge detection as one of statistical inference. Local edge cues, implemented by filters, provide information about the likely positions of edges which can ...
Scott Konishi, Alan L. Yuille, James M. Coughlan, ...
KDD
2007
ACM
198views Data Mining» more  KDD 2007»
14 years 10 months ago
Applying Link-Based Classification to Label Blogs
In analyzing data from social and communication networks, we encounter the problem of classifying objects where there is an explicit link structure amongst the objects. We study t...
Smriti Bhagat, Graham Cormode, Irina Rozenbaum
ALGORITHMICA
2011
13 years 4 months ago
Crossing Numbers of Graphs with Rotation Systems
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
COMBINATORICS
2002
104views more  COMBINATORICS 2002»
13 years 9 months ago
Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption
In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relati...
E. J. Janse van Rensburg, A. Rechnitzer
DM
2002
104views more  DM 2002»
13 years 9 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius