Sciweavers

4377 search results - page 161 / 876
» Mass problems and randomness
Sort
View
ICRA
2003
IEEE
103views Robotics» more  ICRA 2003»
15 years 11 months ago
On addressing the run-cost variance in randomized motion planners
The decades of research in motion planning have resulted in numerous algorithms. Many of the most successful algorithms are randomized and can have widely differing run-times for ...
Pekka Isto, Martti Mäntylä, Juha O. Tuom...
INFOCOM
2003
IEEE
15 years 11 months ago
Random Waypoint Considered Harmful
— This study examines the random waypoint model widely used in the simulation studies of mobile ad hoc networks. Our findings show that this model fails to provide a steady stat...
Jungkeun Yoon, Mingyan Liu, Brian Noble
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
15 years 10 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
DAGM
2008
Springer
15 years 8 months ago
Approximate Parameter Learning in Conditional Random Fields: An Empirical Investigation
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
Filip Korc, Wolfgang Förstner
IJCAI
2007
15 years 8 months ago
Training Conditional Random Fields Using Virtual Evidence Boosting
While conditional random fields (CRFs) have been applied successfully in a variety of domains, their training remains a challenging task. In this paper, we introduce a novel trai...
Lin Liao, Tanzeem Choudhury, Dieter Fox, Henry A. ...