Sciweavers

1950 search results - page 29 / 390
» Varieties of Increasing Trees
Sort
View
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 2 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
SIBGRAPI
1999
IEEE
14 years 28 days ago
Deterministic Texture Analysis and Synthesis Using Tree Structure Vector Quantization
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
Li-Yi Wei
AAAI
2012
11 years 11 months ago
Generalized Monte-Carlo Tree Search Extensions for General Game Playing
General Game Playing (GGP) agents must be capable of playing a wide variety of games skillfully. Monte-Carlo Tree Search (MCTS) has proven an effective reasoning mechanism for thi...
Hilmar Finnsson
ICIP
1994
IEEE
14 years 10 months ago
A Tree Structured Bayesian Scalar Quantizer for Wavelet Based Image Compression
ABSTRACT the pyramid. Recently, a number of promising quanMultiresolution imagedecompositions (e. g., wavelets), in conjunction with a variety of quantization schemes, have been sh...
Birsen Yazici, Mary L. Comer, Rangasami L. Kashyap...
LATIN
2010
Springer
14 years 3 months ago
Lipschitz Unimodal and Isotonic Regression on Paths and Trees
Abstract. We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicit...
Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri