563 search results - page 91 / 113 » Computing approximate PSD factorizations |
ICDM
2010
IEEE
13 years 7 months ago
2010
IEEE
Background knowledge is an important factor in privacy preserving data publishing. Probabilistic distributionbased background knowledge is a powerful kind of background knowledge w...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
Similarity search, namely, finding approximate nearest neighborhoods, is the core of many large scale machine learning or vision applications. Recently, many research results dem...
STACS
2007
Springer
14 years 4 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
ICDE
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...