Sciweavers

2370 search results - page 6 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ECCV
2004
Springer
14 years 11 months ago
A Robust Algorithm for Characterizing Anisotropic Local Structures
This paper proposes a robust estimation and validation framework for characterizing local structures in a positive multi-variate continuous function approximated by a Gaussian-base...
Kazunori Okada, Dorin Comaniciu, Navneet Dalal, Ar...
ICC
2007
IEEE
164views Communications» more  ICC 2007»
14 years 4 months ago
Characterization of an Indoor MIMO channel in Frequency Domain using the 3D-SAGE Algorithm
— In this paper, the frequency domain (FD) SAGE (Space-Alternating Generalized Expectation-maximization) algorithm has been extended to the MIMO case in order to determine the an...
Michail Matthaiou, Nima Razavi-Ghods
CN
2006
83views more  CN 2006»
13 years 9 months ago
A generic characterization of the overheads imposed by IPsec and associated cryptographic algorithms
This paper presents an assessment of the communication overheads of IPsec and evaluates the feasibility of deploying it on handheld devices for the UMTS architecture. A wide range...
Christos Xenakis, Nikolaos Laoutaris, Lazaros F. M...
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 9 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
ALGOSENSORS
2007
Springer
14 years 3 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...