Sciweavers

77 search results - page 9 / 16
» Neumann problems with time singularities
Sort
View
ECCC
2006
97views more  ECCC 2006»
13 years 7 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt
JDA
2006
85views more  JDA 2006»
13 years 7 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Secure Transmission with Multiple Antennas II: The MIMOME Wiretap Channel
The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices a...
Ashish Khisti, Gregory W. Wornell
IJCV
1998
103views more  IJCV 1998»
13 years 7 months ago
Dense Non-Rigid Motion Estimation in Sequences of Medical Images Using Differential Constraints
We describe a new method for computing the displacement vector field in time sequences of 2D or 3D images (4D data). The method is energy-minimizing on the space of correspondence...
Serge Benayoun, Nicholas Ayache
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 4 months ago
Real-time Robust Principal Components' Pursuit
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...
Chenlu Qiu, Namrata Vaswani