5169 search results - page 534 / 1034 » Locality approximation using time |
213
Voted
ASPDAC
2005
ACM
15 years 9 months ago
2005
ACM
-- This paper presents a novel global routing algorithm, AT-PO-GR, to minimize the routing area under both congestion, timing, and RLC crosstalk constraints. The proposed algorithm...
197
click to vote
NIPS
2003
15 years 8 months ago
2003
What happens to the optimal interpretation of noisy data when there exists more than one equally plausible interpretation of the data? In a Bayesian model-learning framework the a...
204
click to vote
ICANN
2010
Springer
15 years 8 months ago
2010
Springer
We propose a model of the hippocampus aimed at learning the timed association between subsequent sensory events. The properties of the neural network allow it to learn and predict ...
194
click to vote
IJIG
2008
15 years 7 months ago
2008
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
180
click to vote
JUCS
2000
15 years 7 months ago
2000
: Since the era of vector and pipelined computing, the computational speed is limited by the memory access time. Faster caches and more cache levels are used to bridge the growing ...