Sciweavers

384 search results - page 68 / 77
» On s-hamiltonian-connected line graphs
Sort
View
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
13 years 10 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas
CORR
2007
Springer
122views Education» more  CORR 2007»
13 years 8 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar
KDD
1997
ACM
161views Data Mining» more  KDD 1997»
14 years 22 days ago
Automated Discovery of Active Motifs in Three Dimensional Molecules
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
Xiong Wang, Jason Tsong-Li Wang, Dennis Shasha, Br...
MVA
2007
137views Computer Vision» more  MVA 2007»
13 years 10 months ago
Fingerprint Core and Delta Detection by Candidate Analysis
This paper presents a new reliable detection of core and delta in fingerprints by candidate analysis. The line search based method, which is one of the reliable approaches to dete...
Tomohiko Ohtsuka, Daisuke Watanabe, Hiroyuki Aoki
APVIS
2006
13 years 10 months ago
Visual analysis of network centralities
Centrality analysis determines the importance of vertices in a network based on their connectivity within the network structure. It is a widely used technique to analyse network-s...
Tim Dwyer, Seok-Hee Hong, Dirk Koschützki, Fa...