Sciweavers

4342 search results - page 517 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
INTERSPEECH
2010
15 years 1 months ago
Combining many alignments for speech to speech translation
Alignment combination (symmetrization) has been shown to be useful for improving Machine Translation (MT) models. Most existing alignment combination techniques are based on heuri...
Sameer Maskey, Steven J. Rennie, Bowen Zhou
GECCO
2004
Springer
16 years 5 days ago
Subthreshold-Seeking Behavior and Robust Local Search
Subthreshold-seeking behavior occurs when the majority of the points that an algorithm samples have an evaluation less than some target threshold. We characterize sets of functions...
L. Darrell Whitley, Keith Bush, Jonathan E. Rowe
UIST
2006
ACM
16 years 22 days ago
Viz: a visual analysis suite for explaining local search behavior
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
Steven Halim, Roland H. C. Yap, Hoong Chuin Lau
FORTE
2007
15 years 8 months ago
The DHCP Failover Protocol: A Formal Perspective
Abstract. We present a formal specification and analysis of a faulttolerant DHCP algorithm, used to automatically configure certain host parameters in an IP network. Our algorith...
Rui Fan, Ralph E. Droms, Nancy D. Griffeth, Nancy ...
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
15 years 7 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha