Sciweavers

5356 search results - page 90 / 1072
» Adventures in time and space
Sort
View
ICALP
2005
Springer
15 years 5 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 12 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
BC
2007
113views more  BC 2007»
15 years 16 hour ago
Akaike causality in state space
We present a new approach of explaining partial causality in multivariate fMRI time series by a state space model. A given single time series can be divided into two noise-driven ...
Kin Foon Kevin Wong, Tohru Ozaki
VLSID
1999
IEEE
91views VLSI» more  VLSID 1999»
15 years 4 months ago
Timed Circuit Synthesis Using Implicit Methods
The design and synthesis of asynchronous circuits is gaining importance in both the industrial and academic worlds. Timed circuits are a class of asynchronous circuits that incorp...
Robert Thacker, Wendy Belluomini, Chris J. Myers
COCOON
2001
Springer
15 years 4 months ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Valerie King, Mikkel Thorup