Sciweavers

2924 search results - page 442 / 585
» Lower Bounds in Distributed Computing
Sort
View
PODC
2009
ACM
16 years 5 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
IPPS
2009
IEEE
15 years 11 months ago
Efficient microarchitecture policies for accurately adapting to power constraints
In the past years Dynamic Voltage and Frequency Scaling (DVFS) has been an effective technique that allowed microprocessors to match a predefined power budget. However, as process...
Juan M. Cebrian, Juan L. Aragón, José...
ICDCS
2006
IEEE
15 years 10 months ago
A Loss and Queuing-Delay Controller for Router Buffer Management
— Active queue management (AQM) in routers has been proposed as a solution to some of the scalability issues associated with TCP’s pure end-to-end approach to congestion contro...
Long Le, Kevin Jeffay, F. Donelson Smith
SAC
2004
ACM
15 years 10 months ago
GD-GhOST: a goal-oriented self-tuning caching algorithm
A popular solution to internet performance problems is the widespread caching of data. Many caching algorithms have been proposed in the literature, most attempting to optimize fo...
Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chry...
CVPR
2007
IEEE
16 years 6 months ago
An Exemplar Model for Learning Object Classes
We introduce an exemplar model that can learn and generate a region of interest around class instances in a training set, given only a set of images containing the visual class. T...
Ondrej Chum, Andrew Zisserman