Sciweavers

44 search results - page 1 / 9
» Minimizing Wide Range Regret with Time Selection Functions
Sort
View
COLT
2008
Springer
13 years 10 months ago
Minimizing Wide Range Regret with Time Selection Functions
Subhash Khot, Ashok Kumar Ponnuswami
PVLDB
2010
91views more  PVLDB 2010»
13 years 7 months ago
Regret-Minimizing Representative Databases
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, R...
ICC
2007
IEEE
141views Communications» more  ICC 2007»
14 years 2 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee
SCALESPACE
2001
Springer
14 years 29 days ago
Selection of Optimal Stopping Time for Nonlinear Diffusion Filtering
We develop a novel time-selection strategy for iterative image restoration techniques: the stopping time is chosen so that the correlation of signal and noise in the filtered imag...
Pavel Mrázek
SBBD
2008
256views Database» more  SBBD 2008»
13 years 10 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...