Sciweavers

34 search results - page 6 / 7
» Finding Data Broadness Via Generalized Nearest Neighbors
Sort
View
SAC
2004
ACM
15 years 3 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo
COMPGEOM
2004
ACM
15 years 3 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
KDD
2001
ACM
124views Data Mining» more  KDD 2001»
15 years 10 months ago
Tri-plots: scalable tools for multidimensional data mining
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answ...
Agma J. M. Traina, Caetano Traina Jr., Spiros Papa...
CCS
2008
ACM
15 years 10 days ago
Privacy oracle: a system for finding application leaks with black box differential testing
We describe the design and implementation of Privacy Oracle, a system that reports on application leaks of user information via the network traffic that they send. Privacy Oracle ...
Jaeyeon Jung, Anmol Sheth, Ben Greenstein, David W...
PPOPP
2010
ACM
15 years 7 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...