Sciweavers

4137 search results - page 55 / 828
» On the number of matchings of a tree
Sort
View
110
Voted
CCCG
2007
15 years 3 months ago
Terminal Steiner Tree with Bounded Edge Length
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
Zhiyong Lin
117
Voted
3DIM
2005
IEEE
15 years 7 months ago
Automatic Registration of Range Images Based on Correspondence of Complete Plane Patches
One of the difficulties in registering two range images scanned by 3D laser scanners is how to get a correct correspondence over the two images automatically. In this paper, we pr...
Wenfeng He, Wei Ma, Hongbin Zha
NAACL
2003
15 years 3 months ago
Sentence Level Discourse Parsing using Syntactic and Lexical Information
We introduce two probabilistic models that can be used to identify elementary discourse units and build sentence-level discourse parse trees. The models use syntactic and lexical ...
Radu Soricut, Daniel Marcu
SIAMDM
2000
103views more  SIAMDM 2000»
15 years 1 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
ICDE
2002
IEEE
121views Database» more  ICDE 2002»
16 years 3 months ago
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
Sergey Melnik, Hector Garcia-Molina, Erhard Rahm