Sciweavers

1712 search results - page 211 / 343
» A Computational Approach to Binding Theory
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 8 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
ICIP
2002
IEEE
16 years 3 months ago
Waterfilling: a connection between information theoretic and perceptually based watermarking
We present a hybrid approach to image watermarking that exploits results from both information theory and perceptual studies. Towards this purpose we use a waterfilling-type algor...
Siva Somasundaram, Rajarathnam Chandramouli
DAC
2008
ACM
16 years 3 months ago
The mixed signal optimum energy point: voltage and parallelism
An energy optimization is proposed that addresses the nontrivial digital contribution to power and impact on performance in high-speed mixed-signal circuits. Parallel energy and b...
Brian P. Ginsburg, Anantha P. Chandrakasan
WWW
2005
ACM
16 years 2 months ago
Design and implementation of a feedback controller for slowdown differentiation on internet servers
Proportional slowdown differentiation (PSD) aims to maintain slowdown ratios between different classes of clients according to their pre-specified differentiation parameters. In t...
Jianbin Wei, Cheng-Zhong Xu
PEPM
2009
ACM
15 years 11 months ago
Designing aspects for side-effect localization
Computation performed in many typical aspects involve side effects. In a purely functional setting, adding such aspects using techniques such as monadification will generally lea...
Kung Chen, Jia-Yin Lin, Shu-Chun Weng, Siau-Cheng ...