Sciweavers

4061 search results - page 324 / 813
» The Dynamics of Change
Sort
View
176
Voted
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 11 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
ISCC
1999
IEEE
111views Communications» more  ISCC 1999»
15 years 11 months ago
Towards TCP-Friendly Adaptive Multimedia Applications Based on RTP
For multimedia senders to benefit the most of dynamically changing availability of network resources they need to adjust their transmission behavior in accordance with the network...
Dorgham Sisalem, Adam Wolisz
DAC
1997
ACM
15 years 11 months ago
Hierarchical Sequence Compaction for Power Estimation
- This paper presents an effective technique for compacting a large sequence of input vectors into a much smaller one such that when the two sequences are applied to any circuit, t...
Radu Marculescu, Diana Marculescu, Massoud Pedram
FPGA
1997
ACM
118views FPGA» more  FPGA 1997»
15 years 11 months ago
Improving Functional Density Through Run-Time Constant Propagation
Circuit specialization techniques such as constant propagation are commonly used to reduce both the hardware resources and cycle time of digital circuits. When recon gurable FPGAs...
Michael J. Wirthlin, Brad L. Hutchings
MICRO
2000
IEEE
121views Hardware» more  MICRO 2000»
15 years 10 months ago
Memory hierarchy reconfiguration for energy and performance in general-purpose processor architectures
Conventional microarchitectures choose a single memory hierarchy design point targeted at the average application. In this paper, we propose a cache and TLB layout and design that...
Rajeev Balasubramonian, David H. Albonesi, Alper B...