2569 search results - page 470 / 514 » Approximate Objects and Approximate Theories |
131
click to vote
KDD
2009
ACM
16 years 11 days 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 ...
122
click to vote
KDD
2007
ACM
16 years 7 days ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
KDD
2005
ACM
16 years 7 days 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...
200
click to vote
POPL
2007
ACM
16 years 4 days ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
188
click to vote
POPL
2006
ACM
16 years 4 days 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...