Sciweavers

203 search results - page 10 / 41
» On Inducing Polygons and Related Problems
Sort
View
ACL
2010
13 years 6 months ago
Finding Cognate Groups Using Phylogenies
A central problem in historical linguistics is the identification of historically related cognate words. We present a generative phylogenetic model for automatically inducing cogn...
David Hall, Dan Klein
IVC
2007
102views more  IVC 2007»
13 years 8 months ago
Analysis of the rubberband algorithm
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
RSCTC
2000
Springer
144views Fuzzy Logic» more  RSCTC 2000»
14 years 4 days ago
Valued Tolerance and Decision Rules
In this paper we introduce the concept of valued tolerance as an extension of the usual concept of indiscernibility (which is a crisp equivalence relation) in rough sets theory. So...
Jerzy Stefanowski, Alexis Tsoukiàs
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
13 years 8 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
14 years 2 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...