Sciweavers

13041 search results - page 378 / 2609
» Simulating space and time
Sort
View
141
Voted
CIE
2005
Springer
16 years 11 days ago
Robust Simulations of Turing Machines with Analytic Maps and Flows
In this paper, we show that closed-form analytic maps and flows can simulate Turing machines in an error-robust manner. The maps and ODEs defining the flows are explicitly obtai...
Daniel S. Graça, Manuel Lameiras Campagnolo...
140
Voted
DATE
2002
IEEE
97views Hardware» more  DATE 2002»
15 years 11 months ago
Fast Method to Include Parasitic Coupling in Circuit Simulations
S-parameter based circuit simulators are used a lot for the design of microwave circuits. The accuracy of these simulators is limited by the fact that they do not take the electro...
B. L. A. Van Thielen, G. A. E. Vandenbosch
CVPR
2007
IEEE
16 years 8 months ago
Efficient Sampling of Disparity Space for Fast And Accurate Matching
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
Jan Cech, Radim Sára
PODS
2005
ACM
131views Database» more  PODS 2005»
16 years 7 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 7 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...