Sciweavers

627 search results - page 18 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
AVI
2008
15 years 1 months ago
Realizing the hidden: interactive visualization and analysis of large volumes of structured data
An emerging trend in Web computing aims at collecting and integrating distributed data. For instance, community driven efforts recently have build ontological repositories made of...
Olaf Noppens, Thorsten Liebig
ICML
2005
IEEE
16 years 1 days ago
Intrinsic dimensionality estimation of submanifolds in Rd
We present a new method to estimate the intrinsic dimensionality of a submanifold M in Rd from random samples. The method is based on the convergence rates of a certain U-statisti...
Matthias Hein, Jean-Yves Audibert
IPSN
2003
Springer
15 years 4 months ago
A Robust Data Delivery Protocol for Large Scale Sensor Networks
Although data forwarding algorithms and protocols have been among the first set of issues explored in sensor networking, how to reliably deliver sensing data through a vast field...
Fan Ye, Gary Zhong, Songwu Lu, Lixia Zhang
BMCBI
2010
121views more  BMCBI 2010»
14 years 11 months ago
Knowledge-based annotation of small molecule binding sites in proteins
Background: The study of protein-small molecule interactions is vital for understanding protein function and for practical applications in drug discovery. To benefit from the rapi...
Ratna R. Thangudu, Manoj Tyagi, Benjamin A. Shoema...
STACS
2007
Springer
15 years 5 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
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...
Artur Czumaj, Christian Sohler