1813 search results - page 334 / 363 » Calculi of Approximation Spaces |
167
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
A recent study by two prominent finance researchers, Fama and French, introduces a new framework for studying risk vs. return: the migration of stocks across size-value portfolio ...
101
Voted
KDD
2005
ACM
16 years 4 months ago
2005
ACM
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
170
Voted
KDD
2003
ACM
16 years 4 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
237
Voted
POPL
2006
ACM
16 years 4 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
131
Voted
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...