Sciweavers

793 search results - page 31 / 159
» Efficient computation of the characteristic polynomial
Sort
View
ALMOB
2008
92views more  ALMOB 2008»
13 years 7 months ago
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You
ICFP
2003
ACM
14 years 7 months ago
Representing reductions of NP-complete problems in logical frameworks: a case study
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
Carsten Schürmann, Jatin Shah
TCS
2008
13 years 7 months ago
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
ICPR
2010
IEEE
13 years 4 months ago
Beyond "Near Duplicates": Learning Hash Codes for Efficient Similar-Image Retrieval
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...
Shumeet Baluja, Michele Covell
FOCS
1994
IEEE
13 years 11 months ago
Fast and Lean Self-Stabilizing Asynchronous Protocols
We consrder asynchronous general topology dynamic networks of identical nameless nodes wzth worst-case transient faults. Starting from any faulty configuration, our protocols self...
Gene Itkis, Leonid A. Levin