Sciweavers

3008 search results - page 394 / 602
» Independence in connected graphs
Sort
View
MOC
2011
15 years 1 months ago
Fast evaluation of modular functions using Newton iterations and the AGM
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
Régis Dupont
IJACT
2010
90views more  IJACT 2010»
15 years 1 months ago
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optima
: We study the interplay of network connectivity and the issues related to the `possibility', `feasibility' and `optimality' for unconditionally reliable message tra...
Arpita Patra, Ashish Choudhury, C. Pandu Rangan, K...
TIT
2010
158views Education» more  TIT 2010»
15 years 1 months ago
Belief propagation, Dykstra's algorithm, and iterated information projections
Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman proje...
John MacLaren Walsh, Phillip A. Regalia
ICASSP
2011
IEEE
14 years 10 months ago
A probabilistic pixel-based approach to detect humans in video streams
Human detection in video streams is an important task in many applications including video surveillance. Surprisingly, only few papers have been devoted to this topic. This paper ...
Sébastien Piérard, Antoine Lejeune, ...
WIOPT
2011
IEEE
14 years 10 months ago
Energy-neutral source-channel coding in energy-harvesting wireless sensors
Abstract—This work addresses the problem of energy allocation over source compression and transmission for a single energy-harvesting sensor. An optimal class of policies is iden...
Paolo Castiglione, Osvaldo Simeone, Elza Erkip, Th...