11328 search results - page 120 / 2266 » Timed Branching Processes |
128
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
116
click to vote
WG
2009
Springer
15 years 10 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
135
click to vote
ICN
2005
Springer
15 years 8 months ago
2005
Springer
ESCORT aims at decreasing the energy cost of communication in dense sensor networks. We employ radio frequency (RF) signal quality assessment in forming communities of redundant no...
123
click to vote
FOSAD
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. A recent branch of cryptography focuses on the physical constraints that a real-life cryptographic device must face, and attempts to exploit these constraints (running ti...
159
Voted
DALT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We describe a model-checking based approach to verification of programs written in the agent programming language Dribble. We define a logic (an extension of the branch...