Sciweavers

356 search results - page 58 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 7 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
ACCV
2006
Springer
14 years 1 months ago
Vision-Based Posing of 3D Virtual Actors
Construction of key poses is one of the most tedious and time consuming steps in synthesizing of 3D virtual actors. Recent alternate schemes expect the user to specify two inputs. ...
Ameya S. Vaidya, Appu Shaji, Sharat Chandran
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 5 months ago
Resource Minimization for Fire Containment
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
Parinya Chalermsook, Julia Chuzhoy
JAIR
2002
95views more  JAIR 2002»
13 years 7 months ago
A Critical Assessment of Benchmark Comparison in Planning
Recent trends in planning research have led to empirical comparison becoming commonplace. The eld has started to settle into a methodology for such comparisons, which for obvious ...
Adele E. Howe, Eric Dahlman
IPPS
2007
IEEE
14 years 1 months ago
Adaptive Distributed Database Replication Through Colonies of Pogo Ants
We address the problem of optimizing the distribution of partially replicated databases over a computer network. Replication is used to increase data availability in the presence ...
Sarah Abdul-Wahid, Razvan Andonie, Joseph Lemley, ...