Sciweavers

5138 search results - page 87 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
15 years 1 months ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish
CORR
2004
Springer
99views Education» more  CORR 2004»
15 years 1 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 8 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,...
119
Voted
ICASSP
2011
IEEE
14 years 5 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»
15 years 1 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