1099 search results - page 154 / 220 » Factored sequence kernels |
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
Interpreters designed for efficiency execute a huge number of indirect branches and can spend more than half of the execution time in indirect branch mispredictions. Branch target...
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
DAC
1996
ACM
15 years 4 months ago
1996
ACM
The testability of basic DSP datapath structures using pseudorandom built-in self-test techniques is examined. The addition of variance mismatched signals is identified as a testi...
VISSYM
2007
15 years 2 months ago
2007
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, ...
78
Voted
CDC
2008
IEEE
15 years 1 months ago
2008
IEEE
In this paper we present a novel algorithm to identify LPV systems with affine parameter dependence operating under open and closed-loop conditions. A factorization is introduced w...