Sciweavers

325 search results - page 30 / 65
» Remarks on the Schoof-Elkies-Atkin algorithm
Sort
View
JCB
2006
124views more  JCB 2006»
13 years 9 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
COLT
2000
Springer
14 years 2 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio
DAC
2000
ACM
14 years 10 months ago
To split or to conjoin: the question in image computation
Image computation is the key step in fixpoint computations that are extensively used in model checking. Two techniques have been used for this step: one based on conjunction of the...
In-Ho Moon, James H. Kukula, Kavita Ravi, Fabio So...
ICDM
2007
IEEE
170views Data Mining» more  ICDM 2007»
14 years 4 months ago
Consensus Clusterings
In this paper we address the problem of combining multiple clusterings without access to the underlying features of the data. This process is known in the literature as clustering...
Nam Nguyen, Rich Caruana
IPSN
2007
Springer
14 years 4 months ago
Blind calibration of sensor networks
This paper considers the problem of blindly calibrating sensor response using routine sensor network measurements. We show that as long as the sensors slightly oversample the sign...
Laura Balzano, Robert Nowak