Sciweavers

1664 search results - page 201 / 333
» Distance labeling in graphs
Sort
View
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 8 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
ICDAR
2011
IEEE
14 years 6 months ago
A Method of Evaluating Table Segmentation Results Based on a Table Image Ground Truther
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
Yanhui Liang, Yizhou Wang, Eric Saund
SSPR
1998
Springer
15 years 10 months ago
Object Recognition from Large Structural Libraries
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
Benoit Huet, Edwin R. Hancock
APBC
2004
164views Bioinformatics» more  APBC 2004»
15 years 8 months ago
Cluster Ensemble and Its Applications in Gene Expression Analysis
Huge amount of gene expression data have been generated as a result of the human genomic project. Clustering has been used extensively in mining these gene expression data to find...
Xiaohua Hu, Illhoi Yoo
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 6 months ago
Towards a More Accurate Carrier Sensing Model for CSMA Wireless Networks
Abstract--In the majority of studies on CSMA wireless networks, a contention graph is used to model the carrier sensing relationships among links. This is a 0-1 model in which two ...
Caihong Kai, Soung Chang Liew