Sciweavers

42230 search results - page 372 / 8446
» Algorithms and Complexity Results for
Sort
View
179
Voted
ICASSP
2011
IEEE
14 years 10 months ago
EM-style optimization of hidden conditional random fields for grapheme-to-phoneme conversion
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ļ...
Georg Heigold, Stefan Hahn, Patrick Lehnen, Herman...
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
15 years 11 months ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled ā€œThree approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
SMA
2009
ACM
157views Solid Modeling» more  SMA 2009»
16 years 1 months ago
Constraint-based model synthesis
We present a method for procedurally modeling general complex 3D shapes. Our approach is targeted towards applications in digital entertainment and gaming and can automatically ge...
Paul Merrell, Dinesh Manocha
CSR
2007
Springer
16 years 29 days ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, āˆ’ , +, Ɨ}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...
COMPGEOM
1995
ACM
15 years 10 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky