3038 search results - page 252 / 608 » High-Speed Function Approximation |
150
click to vote
COLT
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
152
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
184
click to vote
ATMN
1996
15 years 8 months ago
1996
This paper intends to study the characteristics of VBR MPEG sources and performs models for their traffic behaviour. Our analysis focuses on long-time MPEG video films, approximat...
202
click to vote
CGF
2008
15 years 6 months ago
2008
We present a method for rendering approximate soft shadows and diffuse indirect illumination in dynamic scenes. The proposed method approximates the original scene geometry with a...
157
click to vote
ECCC
2008
15 years 6 months ago
2008
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...