Sciweavers

3096 search results - page 529 / 620
» Theory and Use of the EM Algorithm
Sort
View
PODC
2006
ACM
14 years 2 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
JACM
2006
99views more  JACM 2006»
13 years 8 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JMM2
2006
167views more  JMM2 2006»
13 years 8 months ago
Computer Vision Methods for Improved Mobile Robot State Estimation in Challenging Terrains
External perception based on vision plays a critical role in developing improved and robust localization algorithms, as well as gaining important information about the vehicle and ...
Annalisa Milella, Giulio Reina, Roland Siegwart
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 9 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 9 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee