Sciweavers

2252 search results - page 63 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
ICCAD
2003
IEEE
210views Hardware» more  ICCAD 2003»
14 years 4 months ago
Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems
Energy consumption is an important performance parameter for portable and wireless embedded systems. However, energy consumption must be carefully balanced with real-time responsi...
Vishnu Swaminathan, Krishnendu Chakrabarty
IPPS
1999
IEEE
13 years 12 months ago
A Parallel Algorithm for Bound-Smoothing
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Kumar Rajan, Narsingh Deo
ICDT
2009
ACM
148views Database» more  ICDT 2009»
14 years 8 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
13 years 9 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
NIPS
1996
13 years 9 months ago
Reconstructing Stimulus Velocity from Neuronal Responses in Area MT
We employed a white-noise velocity signal to study the dynamics of the response of single neurons in the cortical area MT to visual motion. Responses were quantified using reverse...
Wyeth Bair, James R. Cavanaugh, J. Anthony Movshon