Sciweavers

680 search results - page 61 / 136
» A randomized embedding algorithm for trees
Sort
View
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 10 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
ISCAS
2006
IEEE
116views Hardware» more  ISCAS 2006»
14 years 2 months ago
Wavelet based detection of moving tree branches and leaves in video
—A method for detection of tree branches and leaves in video is proposed. It is observed that the motion vectors of tree branches and leaves exhibit random motion. On the other h...
B. Ugur Töreyin, A. Enis Çetin
CG
2006
Springer
14 years 19 days ago
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
Rémi Coulom
CG
2005
Springer
13 years 8 months ago
A polar-plane-based method for natural illumination of plants and trees
We introduce an illumination method for outdoor scenes containing plants and trees. Our method supports multiresolution plant and tree models based on random L-systems. The method...
Maria J. Vicent, Vicente Rosell, Roberto Viv&oacut...
FOCS
1995
IEEE
14 years 13 days ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos