Sciweavers

1424 search results - page 12 / 285
» Improving on Version Stamps
Sort
View
PAA
2008
14 years 10 months ago
Online nonparametric discriminant analysis for incremental subspace learning and recognition
This paper presents a novel approach for online subspace learning based on an incremental version of the nonparametric discriminant analysis (NDA). For many real-world applications...
Bogdan Raducanu, Jordi Vitrià
DICTA
2003
15 years 5 days ago
Reversible Data Embedding Based on the Haar Wavelet Decomposition
This paper presents an improved version of Tian’s algorithm for reversible data embedding. The improvement is highest at low embedding rates.
Henk J. A. M. Heijmans, Lute Kamstra
HPCC
2009
Springer
15 years 2 months ago
Dynamically Filtering Thread-Local Variables in Lazy-Lazy Hardware Transactional Memory
Abstract--Transactional Memory (TM) is an emerging technology which promises to make parallel programming easier. However, to be efficient, underlying TM system should protect only...
Sutirtha Sanyal, Sourav Roy, Adrián Cristal...
SPIN
2005
Springer
15 years 4 months ago
Improving Spin's Partial-Order Reduction for Breadth-First Search
We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by...
Dragan Bosnacki, Gerard J. Holzmann
TIT
2008
86views more  TIT 2008»
14 years 10 months ago
An Improved Outer Bound for Multiterminal Source Coding
We prove a new outer bound on the rate
Aaron B. Wagner, Venkat Anantharam