1576 search results - page 197 / 316 » Properties of Synthetic Optimization Problems |
204
Voted
CORR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
161
click to vote
TKDE
2010
15 years 3 months ago
2010
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
206
Voted
SIAMJO
2011
14 years 7 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
170
click to vote
WSDM
2012
ACM
14 years 13 days ago
2012
ACM
The phenomenal growth in the volume of easily accessible information via various web-based services has made it essential for service providers to provide users with personalized ...
130
Voted
VLDB
1997
ACM
15 years 9 months ago
1997
ACM
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...