Sciweavers

395 search results - page 65 / 79
» Positive Versions of Polynomial Time
Sort
View
IPL
2007
105views more  IPL 2007»
15 years 1 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
ALT
2006
Springer
15 years 11 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
APPROX
2008
Springer
72views Algorithms» more  APPROX 2008»
15 years 3 months ago
Increasing the Output Length of Zero-Error Dispersers
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
Ariel Gabizon, Ronen Shaltiel
IJCGA
2000
64views more  IJCGA 2000»
15 years 1 months ago
High Fidelity Interval Assignment
Quadrilateral meshing algorithms impose certain constraints on the number of intervals or mesh edges of the curves bounding a surface. When constructing a conformal mesh of a colle...
Scott A. Mitchell
IPMI
2005
Springer
16 years 2 months ago
3D Active Shape Models Using Gradient Descent Optimization of Description Length
Abstract. Active Shape Models are a popular method for segmenting three-dimensional medical images. To obtain the required landmark correspondences, various automatic approaches ha...
Tobias Heimann, Ivo Wolf, Tomos G. Williams, Hans-...