5356 search results - page 374 / 1072 » Adventures in time and space |
192
click to vote
ICCD
1995
IEEE
15 years 10 months ago
1995
IEEE
– This paper describes a new technique for extracting clock-level finite state machines(FSMs) from transistor netlists using symbolic simulation. The transistor netlist is prepr...
191
click to vote
DEXA
2008
Springer
15 years 8 months ago
2008
Springer
Information filtering systems constitute a critical component in modern information seeking applications. As the number of users grows and the information available becomes even bi...
172
click to vote
CCCG
2010
15 years 8 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
185
click to vote
CCCG
2008
15 years 8 months ago
2008
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
197
click to vote
SIMUTOOLS
2008
15 years 8 months ago
2008
Simulations involving processes at very different time scales can be so slow to converge that starting in one state and waiting for a representative sample of the state space to b...