2485 search results - page 355 / 497 » Time Bounded Frequency Computations |
COCOON
1999
Springer
14 years 9 days ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
CCCG
2006
13 years 9 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
TIT
2002
13 years 7 months ago
2002
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Stability properties for continuous-time linear switched systems are at first determined by the (largest) Lyapunov exponent associated with the system, which is the analogous of t...