Sciweavers

1299 search results - page 73 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
14 years 8 months ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson
MM
2010
ACM
271views Multimedia» more  MM 2010»
14 years 7 months ago
Large-scale music tag recommendation with explicit multiple attributes
Social tagging can provide rich semantic information for largescale retrieval in music discovery. Such collaborative intelligence, however, also generates a high degree of tags un...
Zhendong Zhao, Xinxi Wang, Qiaoliang Xiang, Andy M...
IAT
2009
IEEE
15 years 4 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
KDD
2004
ACM
118views Data Mining» more  KDD 2004»
15 years 10 months ago
Parallel computation of high dimensional robust correlation and covariance matrices
The computation of covariance and correlation matrices are critical to many data mining applications and processes. Unfortunately the classical covariance and correlation matrices...
James Chilson, Raymond T. Ng, Alan Wagner, Ruben H...
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
15 years 10 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....