Sciweavers

9842 search results - page 1697 / 1969
» Problem complexity
Sort
View
IJAHUC
2006
71views more  IJAHUC 2006»
15 years 6 months ago
Elapsed time on arrival: a simple and versatile primitive for canonical time synchronisation services
: Time synchronisation is one of the most important and fundamental middleware services for wireless sensor networks. However, there is an apparent disconnect between existing time...
Branislav Kusy, Prabal Dutta, Philip Levis, Mikl&o...
IJCV
2006
227views more  IJCV 2006»
15 years 6 months ago
A Multigrid Platform for Real-Time Motion Computation with Discontinuity-Preserving Variational Methods
Variational methods are among the most accurate techniques for estimating the optic flow. They yield dense flow fields and can be designed such that they preserve discontinuities, ...
Andrés Bruhn, Joachim Weickert, Timo Kohlbe...
IJON
2006
53views more  IJON 2006»
15 years 6 months ago
Sub-intrapersonal space analysis for face recognition
Bayesian subspace analysis has been successfully applied in face recognition. However, it suffers from its operating on a whole face difference and using one global linear subspac...
Xiaoyang Tan, Jun Liu, Songcan Chen
CORR
2007
Springer
84views Education» more  CORR 2007»
15 years 6 months ago
MMSE Optimal Algebraic Space-Time Codes
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
G. Susinder Rajan, B. Sundar Rajan
180
Voted
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
« Prev « First page 1697 / 1969 Last » Next »