Sciweavers

2887 search results - page 84 / 578
» Name Generation and Linearity
Sort
View
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
15 years 11 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti
COLT
1998
Springer
15 years 10 months ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann
149
Voted
COLING
2008
15 years 7 months ago
Extracting Synchronous Grammar Rules From Word-Level Alignments in Linear Time
We generalize Uno and Yagiura's algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the tw...
Hao Zhang, Daniel Gildea, David Chiang
VMV
2000
169views Visualization» more  VMV 2000»
15 years 7 months ago
A Non-Linear Subdivision Scheme for Triangle Meshes
Subdivision schemes are commonly used to obtain dense or smooth data representations from sparse discrete data. E. g., B-splines are smooth curves or surfaces that can be construc...
Stefan Karbacher, Stephan Seeger, Gerd Häusle...
NIPS
2003
15 years 7 months ago
Multiple-Instance Learning via Disjunctive Programming Boosting
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classification problems where labels are associated with se...
Stuart Andrews, Thomas Hofmann