Sciweavers

1578 search results - page 229 / 316
» Algorithmic randomness of continuous functions
Sort
View
COSIT
1997
Springer
143views GIS» more  COSIT 1997»
14 years 29 days ago
Using Hierarchical Spatial Data Structures for Hierarchical Spatial Reasoning
This paper gives a definition of Hierarchical Spatial Reasoning, which computes increasingly better results in a hierarchical fashion and stops the computation when a result is ac...
Sabine Timpf, Andrew U. Frank
ASIAN
2004
Springer
153views Algorithms» more  ASIAN 2004»
14 years 16 days ago
Chi-Square Matrix: An Approach for Building-Block Identification
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...
Chatchawit Aporntewan, Prabhas Chongstitvatana
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
14 years 26 days ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
12 years 11 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
14 years 6 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick