5169 search results - page 646 / 1034 » Locality approximation using time |
176
click to vote
RT
1995
Springer
15 years 10 months ago
1995
Springer
Reconstruction is imperative whenever an image or a volume needs to be resampled as a result of an affine or perspective transformation, texture mapping, or volume rendering. We p...
159
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
167
click to vote
AAAI
2007
15 years 8 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
195
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
178
click to vote
FMCAD
2008
Springer
15 years 8 months ago
2008
Springer
Abstract--This paper presents the verification of an asynchronous arbiter modeled at the circuit level with non-linear ordinary differential equations. We use Brockett's annul...