Sciweavers

384 search results - page 73 / 77
» On s-hamiltonian-connected line graphs
Sort
View
ICDAR
1995
IEEE
13 years 11 months ago
Efficient analysis of complex diagrams using constraint-based parsing
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...
Robert P. Futrelle, Nikos Nikolakis
SIROCCO
2004
13 years 8 months ago
Time Efficient Gossiping in Known Radio Networks
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
Leszek Gasieniec, Igor Potapov, Qin Xin
CSDA
2007
115views more  CSDA 2007»
13 years 7 months ago
Algorithms for compact letter displays: Comparison and evaluation
Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multi...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
SIGGRAPH
1997
ACM
13 years 11 months ago
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
Frédo Durand, George Drettakis, Claude Puec...
BMCBI
2010
147views more  BMCBI 2010»
13 years 7 months ago
Learning biological network using mutual information and conditional independence
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...
Dong-Chul Kim, Xiaoyu Wang, Chin-Rang Yang, Jean G...