Sciweavers

3341 search results - page 548 / 669
» On Bounded Queries and Approximation
Sort
View
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
15 years 6 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
ICCAD
2003
IEEE
127views Hardware» more  ICCAD 2003»
15 years 6 months ago
Code Placement with Selective Cache Activity Minimization for Embedded Real-time Software Design
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
Junhyung Um, Taewhan Kim
CVPR
2010
IEEE
15 years 6 months ago
Spike Train Driven Dynamical Models for Human Actions
We investigate dynamical models of human motion that can support both synthesis and analysis tasks. Unlike coarser discriminative models that work well when action classes are ...
Michalis Raptis, Kamil Wnuk , Stefano Soatto
ICFCA
2009
Springer
15 years 4 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
FOCS
2009
IEEE
15 years 4 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry