Sciweavers

341 search results - page 55 / 69
» Paired bondage in trees
Sort
View
DAM
1999
105views more  DAM 1999»
14 years 11 months ago
The b-chromatic Number of a Graph
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
Robert W. Irving, David Manlove
RSA
2010
89views more  RSA 2010»
14 years 10 months ago
Edge flows in the complete random-lengths network
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
David J. Aldous, Shankar Bhamidi
TCBB
2010
137views more  TCBB 2010»
14 years 10 months ago
Alignments of RNA Structures
— We describe a theoretical unifying framework to express comparison of RNA structures, which we call alignment hierarchy. This framework relies on the definition of common supe...
Guillaume Blin, Alain Denise, Serge Dulucq, Claire...
ICPR
2000
IEEE
16 years 26 days ago
A Quick 3D-2D Registration Method for a Wide-Range of Applications
Amethod for quick determination of the position and pose of a 3D free-form object with respect to its 2D projective image(s) is proposed. It is a precondition of the method that a...
Yasuyo Kita, Nobuyuki Kita, Dale L. Wilson, J. Ali...
WWW
2005
ACM
16 years 14 days ago
Algorithmic detection of semantic similarity
Automatic extraction of semantic information from text and links in Web pages is key to improving the quality of search results. However, the assessment of automatic semantic meas...
Ana Gabriela Maguitman, Filippo Menczer, Heather R...