Sciweavers

2597 search results - page 262 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
TCS
2008
15 years 1 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...
104
Voted
WDAG
2010
Springer
204views Algorithms» more  WDAG 2010»
15 years 7 days ago
The Cost of Privatization
Software transactional memory (STM) guarantees that a transaction, consisting of a sequence of operations on the memory, appears to be executed atomically. In practice, it is impor...
Hagit Attiya, Eshcar Hillel
132
Voted
CVPR
2010
IEEE
14 years 12 months ago
Multi-structure model selection via kernel optimisation
Our goal is to fit the multiple instances (or structures) of a generic model existing in data. Here we propose a novel model selection scheme to estimate the number of genuine str...
Tat-Jun Chin, David Suter, Hanzi Wang
TSP
2010
14 years 8 months ago
LS-CS-residual (LS-CS): compressive sensing on least squares residual
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
Namrata Vaswani
109
Voted
ICASSP
2011
IEEE
14 years 5 months ago
New radix-based FHT algorithm for computing the discrete Hartley transform
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
Monir Taha Hamood, Said Boussakta