2738 search results - page 260 / 548 » The Frobenius Problem and Its Generalizations |
137
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, w...
161
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information...
228
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
264
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
202
click to vote
PAKDD
2009
ACM
16 years 3 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...