Sciweavers

130 search results - page 6 / 26
» Exact Algorithms for Exact Satisfiability and Number of Perf...
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Performance Modelling of Peer-to-Peer Routing
We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well a...
Idris A. Rai, Andrew Brampton, Andrew MacQuire, La...
RECOMB
2004
Springer
14 years 7 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
BMCBI
2007
106views more  BMCBI 2007»
13 years 7 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 4 months ago
Cause Clue Clauses: Error Localization using Maximum Satisfiability
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...
Manu Jose, Rupak Majumdar
TIT
2010
171views Education» more  TIT 2010»
13 years 2 months ago
Analysis of orthogonal matching pursuit using the restricted isometry property
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
Mark A. Davenport, Michael B. Wakin