139 search results - page 18 / 28 » Computing crossing numbers in quadratic time |
WALCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...
PODC
2011
ACM
12 years 11 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
CHI
2004
ACM
14 years 9 months ago
2004
ACM
A number of global trends have a large influence on the way we use technology in our life and work, like: ? increasing connectivity and connected devices (any time, any place, any...
ICNSC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Flow level measurements are used to provide insights into the traffic flow crossing a network link. However, existing flow based network detection devices lack adaptive reconfi...