Sciweavers

170 search results - page 27 / 34
» On computational properties of chains of recurrences
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Noise Tolerance of Expanders and Sublinear Expander Reconstruction
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
Satyen Kale, Yuval Peres, C. Seshadhri
MMSEC
2004
ACM
126views Multimedia» more  MMSEC 2004»
14 years 23 days ago
Key-dependency for a wavelet-based blind watermarking algorithm
When a host image is watermarked multiple times by the same algorithm collisions can occur. This makes it difficult for an image to host multiple watermarks. But this hosting is n...
Michael Brachtl, Andreas Uhl, Werner Dietl
DANCE
2002
IEEE
14 years 9 days ago
Active Names: Flexible Location and Transport of Wide-Area Resources
In this paper, we explore flexible name resolution as a way of supporting extensibility for wide-area distributed services. Our approach, called Active Names, maps names to a cha...
Amin Vahdat, Michael Dahlin, Thomas E. Anderson, A...
TC
2002
13 years 7 months ago
Dynamic Power Management for Nonstationary Service Requests
Dynamic Power Management (DPM) is a design methodology aiming at reducing power consumption of electronic systems by performing selective shutdown of idle system resources. The eff...
Eui-Young Chung, Luca Benini, Alessandro Bogliolo,...
BMVC
2010
13 years 5 months ago
Graph-based Analysis of Textured Images for Hierarchical Segmentation
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...
Raffaele Gaetano, Giuseppe Scarpa, Tamás Sz...