Sciweavers

6111 search results - page 148 / 1223
» Time, Hardware, and Uniformity
Sort
View
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 7 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
12 years 23 days ago
Characterizing continuous time random walks on time varying graphs
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
Daniel R. Figueiredo, Philippe Nain, Bruno F. Ribe...
ISW
2009
Springer
14 years 4 months ago
MAC Precomputation with Applications to Secure Memory
We present ShMAC (Shallow MAC), a fixed input length message authentication code that performs most of the computation prior to the availability of the message. Specifically, Sh...
Juan A. Garay, Vladimir Kolesnikov, Rae McLellan
MDM
2004
Springer
110views Communications» more  MDM 2004»
14 years 3 months ago
Universal Trajectory Queries for Moving Object Databases
In this paper, we consider a data model for uncertain trajectories of moving objects. In our model, the trajectory is a vector of uniform stochastic processes. We study “univers...
Hoda Mokhtar, Jianwen Su
DM
2006
91views more  DM 2006»
13 years 10 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber