Sciweavers

4103 search results - page 276 / 821
» Some results on the Collatz problem
Sort
View
ACL
2001
15 years 8 months ago
Constraints on Strong Generative Power
We consider the question "How much strong generative power can be squeezed out of a formal system without increasing its weak generative power?" and propose some theoret...
David Chiang
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
15 years 8 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan
WSC
2004
15 years 8 months ago
Optimal Computing Budget Allocation Under Correlated Sampling
We consider the optimal computing budget allocation (OCBA) problem where the simulated designs are correlated. The exact optimal allocation is presented for two designs, and an ap...
Michael C. Fu, Jian-Qiang Hu, Chun-Hung Chen, Xiao...
WSCG
2004
170views more  WSCG 2004»
15 years 8 months ago
An Image-Based Multiresolution Model for Interactive Foliage Rendering
This paper presents a new method for realistic real-time rendering of tree foliage. Some approaches to this problem have been presented before but the quality of their results was...
Javier Lluch, Emilio Camahort, Roberto Vivó
ANLP
2000
163views more  ANLP 2000»
15 years 8 months ago
Automatic construction of parallel English-Chinese corpus for cross-language information retrieval
A major obstacle to the construction of a probabilistic translation model is the lack of large parallel corpora. In this paper we first describe a parallel text mining system that...
Jiang Chen, Jian-Yun Nie