9997 search results - page 1860 / 2000 » The case for crowd computing |
130
click to vote
MOBIHOC
2009
ACM
16 years 5 months ago
2009
ACM
We consider a high density of sensors randomly placed in a geographical area for event monitoring. The monitoring regions of the sensors may have significant overlap, and a subset...
146
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
184
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
142
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
161
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...