Sciweavers

386 search results - page 9 / 78
» Fundamental Questions
Sort
View
SIGACT
2010
74views more  SIGACT 2010»
13 years 8 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel
APPML
2005
55views more  APPML 2005»
13 years 9 months ago
Recovering a phylogenetic tree using pairwise closure operations
A fundamental task in evolutionary biology is the amalgamation of a collection P of leaf-labelled trees into a single parent tree. A desirable feature of any such amalgamation is ...
Katharina T. Huber, Vincent Moulton, Charles Sempl...
ICIP
2007
IEEE
14 years 11 months ago
On the Resolution Limits of Superimposed Projection
Multi-projector super-resolution is the dual of multi-camera superresolution. The goal of projector super-resolution is to produce a high resolution frame via superimposition of m...
Niranjan Damera-Venkata, Nelson L. Chang
SCL
2010
95views more  SCL 2010»
13 years 8 months ago
Is measurement-based feedback still better for quantum control systems?
In this paper, we put forward a fundamental question concerning feedback control of quantum systems: Is measurement-based feedback control still better than openloop control? In c...
Bo Qi, Lei Guo
BMCBI
2004
85views more  BMCBI 2004»
13 years 9 months ago
Frequent occurrence of recognition Site-like sequences in the restriction endonucleases
Background: There are two different theories about the development of the genetic code. Woese suggested that it was developed in connection with the amino acid repertoire, while C...
Jan C. Biro, Josephine M. K. Biro