Sciweavers

670 search results - page 43 / 134
» Intractability and clustering with constraints
Sort
View
PERCOM
2008
ACM
16 years 5 months ago
Topology Formation in IEEE 802.15.4: Cluster-Tree Characterization
The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through ...
Francesca Cuomo, Sara Della Luna, Petia Todorova, ...
IDA
2009
Springer
16 years 25 days ago
Probabilistic Factorization of Non-negative Data with Entropic Co-occurrence Constraints
Abstract. In this paper we present a probabilistic algorithm which factorizes non-negative data. We employ entropic priors to additionally satisfy that user specified pairs of fac...
Paris Smaragdis, Madhusudana V. S. Shashanka, Bhik...
JSSPP
2001
Springer
15 years 10 months ago
Coscheduling under Memory Constraints in a NOW Environment
Networks of Workstations (NOW) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicat...
Francesc Giné, Francesc Solsona, Porfidio H...
ICASSP
2010
IEEE
15 years 6 months ago
Multiplicative update rules for nonnegative matrix factorization with co-occurrence constraints
Nonnegative matrix factorization (NMF) is a widely-used tool for obtaining low-rank approximations of nonnegative data such as digital images, audio signals, textual data, financ...
Steven K. Tjoa, K. J. Ray Liu
CICLING
2009
Springer
16 years 6 months ago
Semi-supervised Clustering for Word Instances and Its Effect on Word Sense Disambiguation
We propose a supervised word sense disambiguation (WSD) system that uses features obtained from clustering results of word instances. Our approach is novel in that we employ semi-s...
Kazunari Sugiyama, Manabu Okumura