Sciweavers

243 search results - page 25 / 49
» Coverage-biased Random Exploration of Models
Sort
View
PODC
2004
ACM
14 years 1 months ago
Computation in networks of passively mobile finite-state sensors
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
Dana Angluin, James Aspnes, Zoë Diamadi, Mich...
BMCBI
2007
128views more  BMCBI 2007»
13 years 7 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 8 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
MIDDLEWARE
2004
Springer
14 years 29 days ago
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
Márk Jelasity, Rachid Guerraoui, Anne-Marie...
ICML
2008
IEEE
14 years 8 months ago
Training structural SVMs when exact inference is intractable
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...
Thomas Finley, Thorsten Joachims