103 search results - page 19 / 21 » Generalized MPU Implicits Using Belief Propagation |
KDD
2010
ACM
13 years 9 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
LCPC
2005
Springer
13 years 12 months ago
2005
Springer
Compilers employ system models, sometimes implicitly, to make code optimization decisions. These models are analytic; they reflect their implementor’s understanding and beliefs ...
SIGMOD
2007
ACM
14 years 6 months ago
2007
ACM
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
IPSN
2007
Springer
14 years 15 days ago
2007
Springer
Large-scale sensor network applications require in-network processing and data fusion to compute statistically relevant summaries of the sensed measurements. This paper studies di...