Sciweavers

478 search results - page 77 / 96
» Improving probability bounds by optimization over subsets
Sort
View
ICDCS
2005
IEEE
14 years 1 months ago
Controlling Gossip Protocol Infection Pattern Using Adaptive Fanout
We propose and evaluate a model for controlling infection patterns defined over rounds or real time in a gossipbased protocol using adaptive fanout. We model three versions of go...
Satish Verma, Wei Tsang Ooi
ICASSP
2008
IEEE
14 years 2 months ago
Learning to satisfy
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
Frederic Thouin, Mark Coates, Brian Eriksson, Robe...
ISBRA
2009
Springer
14 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 7 months ago
Quickest Change Detection of a Markov Process Across a Sensor Array
Recent attention in quickest change detection in the multi-sensor setting has been on the case where the densities of the observations change at the same instant at all the sensor...
Vasanthan Raghavan, Venugopal V. Veeravalli
ESA
2006
Springer
207views Algorithms» more  ESA 2006»
13 years 11 months ago
Cheating by Men in the Gale-Shapley Stable Matching Algorithm
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
Chien-Chung Huang