Sciweavers

684 search results - page 38 / 137
» A characterization of b-perfect graphs
Sort
View
GC
2006
Springer
15 years 1 months ago
On n-partite Tournaments with Unique n-cycle
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
Gregory Gutin, Arash Rafiey, Anders Yeo
ICPR
2008
IEEE
15 years 8 months ago
Object recognition using graph spectral invariants
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
Bai Xiao, Richard C. Wilson, Edwin R. Hancock
109
Voted
ICASSP
2010
IEEE
15 years 11 days ago
Random attributed graphs for statistical inference from content and context
Coping with Information Overload is a major challenge of the 21st century. Huge volumes and varieties of multilingual data must be processed to extract salient information. Previo...
Allen L. Gorin, Carey E. Priebe, John Grothendieck
108
Voted
CISS
2008
IEEE
15 years 8 months ago
Identifying sufficient statistics in information networks
Abstract –Given a network targeting information transmission, this paper considers the problem of identifying a set of edges or nodes whose transmission is sufficient to determin...
Huaiyu Dai, Husheng Li
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
15 years 8 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro