Sciweavers

492 search results - page 52 / 99
» Perfect Matching Preservers
Sort
View
ICIP
2009
IEEE
14 years 9 months ago
Randomness-in-Structured Ensembles for compressed sensing of images
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
Abdolreza A. Moghadam, Hayder Radha
EMSOFT
2007
Springer
15 years 6 months ago
Loosely time-triggered architectures based on communication-by-sampling
We address the problem of mapping a set of processes which communicate synchronously on a distributed platform. The Time Triggered Architecture (TTA) proposed by Kopetz for the co...
Albert Benveniste, Paul Caspi, Marco Di Natale, Cl...
ADC
2006
Springer
125views Database» more  ADC 2006»
15 years 3 months ago
A reconstruction-based algorithm for classification rules hiding
Data sharing between two organizations is common in many application areas e.g. business planing or marketing. Useful global patterns can be discovered from the integrated dataset...
Juggapong Natwichai, Xue Li, Maria E. Orlowska
ECCV
2006
Springer
16 years 1 months ago
Tracking and Labelling of Interacting Multiple Targets
Abstract. Successful multi-target tracking requires solving two problems - localize the targets and label their identity. An isolated target's identity can be unambiguously pr...
Josephine Sullivan, Stefan Carlsson
ICPR
2008
IEEE
15 years 6 months ago
Indexing and retrieving cursive documents without recognition
A large amount of handwritten documents exist in image form, as scanned documents. The supporting electronic media allows for better preservation, but to access their content they...
Antonio Clavelli, Luigi P. Cordella, Claudio De St...