Sciweavers

4860 search results - page 63 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
BMCBI
2010
104views more  BMCBI 2010»
13 years 7 months ago
FragViz: visualization of fragmented networks
Background: Researchers in systems biology use network visualization to summarize the results of their analysis. Such networks often include unconnected components, which popular ...
Miha Stajdohar, Minca Mramor, Blaz Zupan, Janez De...
ECCC
2007
90views more  ECCC 2007»
13 years 7 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 8 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
SIAMSC
2008
106views more  SIAMSC 2008»
13 years 7 months ago
Multilevel Linear Sampling Method for Inverse Scattering Problems
A novel multilevel algorithm is presented for implementing the widely used linear sampling method in inverse obstacle scattering problems. The new method is shown to possess asympt...
Jingzhi Li, Hongyu Liu, Jun Zou
STACS
2009
Springer
14 years 2 months ago
Quantum Query Complexity of Multilinear Identity Testing
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
Vikraman Arvind, Partha Mukhopadhyay