Sciweavers

7228 search results - page 1048 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
CVGIP
2006
75views more  CVGIP 2006»
15 years 4 months ago
Momentum-based parameterization of dynamic character motion
This paper presents a system for rapid editing of highly dynamic motion capture data. At the heart of this system is an optimization algorithm that can transform the captured moti...
Yeuhi Abe, C. Karen Liu, Zoran Popovic
JACM
2006
99views more  JACM 2006»
15 years 4 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
SIGIR
2008
ACM
15 years 4 months ago
Topic-bridged PLSA for cross-domain text classification
In many Web applications, such as blog classification and newsgroup classification, labeled data are in short supply. It often happens that obtaining labeled data in a new domain ...
Gui-Rong Xue, Wenyuan Dai, Qiang Yang, Yong Yu
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
15 years 4 months ago
The Nonstochastic Multiarmed Bandit Problem
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freun...
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
15 years 4 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
« Prev « First page 1048 / 1446 Last » Next »