Sciweavers

2523 search results - page 101 / 505
» Objective: In Minimum Context
Sort
View
TIT
2008
103views more  TIT 2008»
15 years 3 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
PIMRC
2010
IEEE
15 years 1 months ago
Low-complexity admission control for distributed power-controlled networks with stochastic channels
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
Stepán Kucera, Bing Zhang
127
Voted
ICASSP
2008
IEEE
15 years 10 months ago
Simultaneous and fast 3D tracking of multiple faces in video by GPU-based stream processing
In this work, we implement a real-time visual tracker that targets the position and 3D pose of objects in video sequences, specifically faces. Using Stream Processors for perform...
Oscar Mateo Lozano, Kazuhiro Otsuka
127
Voted
3DPVT
2004
IEEE
151views Visualization» more  3DPVT 2004»
15 years 7 months ago
Spacetime-Coherent Geometry Reconstruction from Multiple Video Streams
By reconstructing time-varying geometry one frame at a time, one ignores the continuity of natural motion, wasting useful information about the underlying video-image formation pr...
Marcus A. Magnor, Bastian Goldlücke
IPCO
2010
153views Optimization» more  IPCO 2010»
15 years 1 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi