Sciweavers

1578 search results - page 212 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 10 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
CAD
2011
Springer
13 years 1 months ago
Principal curvature ridges and geometrically salient regions of parametric B-spline surfaces
Ridges are characteristic curves of a surface that mark salient intrinsic features of its shape and are therefore valuable for shape matching, surface quality control, visualizati...
Suraj Musuvathy, Elaine Cohen, James N. Damon, Joo...
CHI
2005
ACM
14 years 10 months ago
Studying the effectiveness of MOVE: a contextually optimized in-vehicle navigation system
In-vehicle navigation has changed substantially in recent years, due to the advent of computer generated maps and directions. However, these maps are still problematic, due to a m...
Joonhwan Lee, Jodi Forlizzi, Scott E. Hudson
SOSP
2005
ACM
14 years 7 months ago
Implementing declarative overlays
Overlay networks are used today in a variety of distributed systems ranging from file-sharing and storage systems to communication infrastructures. However, designing, building a...
Boon Thau Loo, Tyson Condie, Joseph M. Hellerstein...
ISI
2006
Springer
13 years 10 months ago
An Embedded Bayesian Network Hidden Markov Model for Digital Forensics
In the paper we combine a Bayesian Network model for encoding forensic evidence during a given time interval with a Hidden Markov Model (EBN-HMM) for tracking and predicting the de...
Olivier Y. de Vel, Nianjun Liu, Terry Caelli, Tib&...