Sciweavers

217 search results - page 19 / 44
» Filling the gap between biology and computer science
Sort
View
WG
2004
Springer
14 years 25 days ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji

Publication
189views
15 years 5 months ago
Packet Trains-Measurements and a New Model for Computer Network Traffic
Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival pr...
R. Jain, S. Routhier
FOCS
2008
IEEE
13 years 8 months ago
Quantum Multi Prover Interactive Proofs with Communicating Provers
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
Michael Ben-Or, Avinatan Hassidim, Haran Pilpel
IJFCS
2006
130views more  IJFCS 2006»
13 years 7 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
FOCS
2004
IEEE
13 years 11 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev