Sciweavers

2735 search results - page 497 / 547
» Comparing notions of randomness
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 9 months ago
Fast approximate spectral clustering
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-s...
Donghui Yan, Ling Huang, Michael I. Jordan
MOBIHOC
2009
ACM
14 years 9 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 9 months ago
Domain-constrained semi-supervised mining of tracking models in sensor networks
Accurate localization of mobile objects is a major research problem in sensor networks and an important data mining application. Specifically, the localization problem is to deter...
Rong Pan, Junhui Zhao, Vincent Wenchen Zheng, Jeff...
KDD
2004
ACM
131views Data Mining» more  KDD 2004»
14 years 9 months ago
Fast nonlinear regression via eigenimages applied to galactic morphology
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...
Brigham Anderson, Andrew W. Moore, Andrew Connolly...
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
14 years 9 months ago
Experimental design for solicitation campaigns
Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These tech...
Uwe F. Mayer, Armand Sarkissian