Sciweavers

5153 search results - page 73 / 1031
» Introduction to Randomized Algorithms
Sort
View
CORR
2004
Springer
99views Education» more  CORR 2004»
14 years 9 months ago
Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms
Abstract. Starting with a monodisperse configuration with n size
Philippe Chassaing, Regine Marchand
IROS
2008
IEEE
165views Robotics» more  IROS 2008»
15 years 4 months ago
Probabilistic navigation in dynamic environment using Rapidly-exploring Random Trees and Gaussian processes
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
Chiara Fulgenzi, Christopher Tay, Anne Spalanzani,...
ICASSP
2011
IEEE
14 years 1 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...
TPDS
1998
76views more  TPDS 1998»
14 years 9 months ago
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In th...
Sanguthevar Rajasekaran, Sartaj Sahni
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 7 days ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri