Sciweavers

5115 search results - page 507 / 1023
» On Randomized Lanczos Algorithms
Sort
View
STACS
2009
Springer
16 years 1 months ago
On Approximating Multi-Criteria TSP
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
Bodo Manthey
INFOCOM
2007
IEEE
16 years 1 months ago
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
Junshan Zhang, Dong Zheng, Mung Chiang
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 8 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
16 years 6 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
DATE
2009
IEEE
133views Hardware» more  DATE 2009»
16 years 1 months ago
Energy efficient multiprocessor task scheduling under input-dependent variation
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
Jason Cong, Karthik Gururaj