Sciweavers

17760 search results - page 3548 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
TCS
2010
13 years 6 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
TIFS
2010
186views more  TIFS 2010»
13 years 6 months ago
An abuse-free fair contract-signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang
TKDE
2010
182views more  TKDE 2010»
13 years 6 months ago
MILD: Multiple-Instance Learning via Disambiguation
In multiple-instance learning (MIL), an individual example is called an instance and a bag contains a single or multiple instances. The class labels available in the training set ...
Wu-Jun Li, Dit-Yan Yeung
TOIS
2010
128views more  TOIS 2010»
13 years 6 months ago
Learning author-topic models from text corpora
We propose a new unsupervised learning technique for extracting information about authors and topics from large text collections. We model documents as if they were generated by a...
Michal Rosen-Zvi, Chaitanya Chemudugunta, Thomas L...
TON
2010
147views more  TON 2010»
13 years 6 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
« Prev « First page 3548 / 3552 Last » Next »