Sciweavers

2715 search results - page 318 / 543
» Total Generalized Variation
Sort
View
FOCS
2000
IEEE
15 years 8 months ago
Hierarchical Placement and Network Design Problems
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
Sudipto Guha, Adam Meyerson, Kamesh Munagala
122
Voted
RTCSA
2000
IEEE
15 years 8 months ago
Optimal scheduling of imprecise computation tasks in the presence of multiple faults
With the advance of applications such as multimedia, imagelspeech processing and real-time AI, real-time computing models allowing to express the “timeliness versus precision”...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
110
Voted
ISLPED
2000
ACM
99views Hardware» more  ISLPED 2000»
15 years 8 months ago
Energy minimization with guaranteed quality of service
Quality of service (QoS) is one of the key features for new Internet-based multimedia and other applications. Meanwhile, energy remains as a big concern for systems that perform s...
Gang Qu, Miodrag Potkonjak
128
Voted
ADBIS
2000
Springer
79views Database» more  ADBIS 2000»
15 years 8 months ago
Distributed Searching of k-Dimensional Data with Almost Constant Costs
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
Adriano Di Pasquale, Enrico Nardelli
FOCS
1999
IEEE
15 years 8 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl