1518 search results - page 116 / 304 » Exact and Approximate Bandwidth |
127
click to vote
UC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
111
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
125
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we study multiple target detection using Bayesian learning. The main aim of the paper is to present a computationally efficient way to compute the belief map update ...
133
click to vote
AINA
2004
IEEE
15 years 8 months ago
2004
IEEE
The design of the IP protocol makes it difficult to reliably identify the originator of an IP packet making the defense against Distributed Denial of Service attacks one of the ha...
139
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Moment computation is essential to the analysis of stochastic kinetic models of biochemical reaction networks. It is often the case that the moment evolution, usually the first and...