1578 search results - page 230 / 316 » Algorithmic randomness of continuous functions |
170
click to vote
CVPR
2010
IEEE
15 years 12 months ago
2010
IEEE
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
161
click to vote
ICA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
167
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
151
click to vote
SC
2005
ACM
15 years 12 months ago
2005
ACM
For decades, the high-performance computing (HPC) community has focused on performance, where performance is defined as speed. To achieve better performance per compute node, mic...
152
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract--Digital processing techniques are based on representing a continuous-time signal by a discrete set of samples. This paper treats the problem of reconstructing a periodic ...