Sciweavers

1243 search results - page 212 / 249
» Complexity reduction of C-Algorithm
Sort
View
JAIR
2006
101views more  JAIR 2006»
15 years 1 months ago
Resource Allocation Among Agents with MDP-Induced Preferences
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
Dmitri A. Dolgov, Edmund H. Durfee
JRTIP
2008
118views more  JRTIP 2008»
15 years 1 months ago
A fast feature-assisted adaptive early termination approach for multiple reference frames motion estimation in H.264
Abstract The multiple reference frames motion estimation approach used in H.264 is computationally intensive. This paper presents a fast or computationally efficient feature-assist...
Jianfeng Ren, Nasser D. Kehtarnavaz, Madhukar Buda...
JSAC
2008
106views more  JSAC 2008»
15 years 1 months ago
Enhanced multiuser random beamforming: dealing with the not so large number of users case
We consider the downlink of a wireless system with an M-antenna base station and K single-antenna users. A limited feedback-based scheduling and precoding scenario is considered th...
Marios Kountouris, David Gesbert, Thomas Sälz...
LISP
2008
96views more  LISP 2008»
15 years 1 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
15 years 1 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...