Sciweavers

5115 search results - page 451 / 1023
» On Randomized Lanczos Algorithms
Sort
View
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
16 years 2 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
ICASSP
2008
IEEE
16 years 2 months ago
Performance and robustness: A trade-off in dynamic signature verification
A performance and robustness study for on-line signature veri cation is presented. Experiments are carried out on the MCYT database comprising 16,500 signatures from 330 subjects,...
Javier Galbally, Julian Fiérrez, Javier Ort...
ICPR
2008
IEEE
16 years 2 months ago
Robust indoor activity recognition via boosting
In this paper, a novel statistical indoor activity recognition algorithm is introduced. While conditional random fields (CRFs) have prominent properties to this task, no optimal ...
Masamichi Shimosaka, Taketoshi Mori, Tomomasa Sato
ICC
2007
IEEE
16 years 1 months ago
UWB Impulse Radio Receivers Derived from a Gaussian Mixture Interference Model
— One of the main concerns in ultra wide band (UWB) impulse radio (IR) technology is the presence of severe multiple access interference (MAI). Efficient receivers should theref...
Tomaso Erseghe, Valentina Cellini, Gabriele Don&aa...
CIVR
2007
Springer
280views Image Analysis» more  CIVR 2007»
16 years 1 months ago
Demonstration of image retrieval based on illumination invariant textural MRF features
Content-based image retrieval (CBIR) systems target database images using feature similarities with respect to the query. Our CBIR demonstration utilises novel illumination invari...
Pavel Vacha, Michal Haindl