Sciweavers

546 search results - page 25 / 110
» Extended Null-Move Reductions
Sort
View
IEEEPACT
1999
IEEE
14 years 24 days ago
Predicated Static Single Assignment
Increases in instruction level parallelism are needed to exploit the potential parallelism available in future wide issue architectures. Predicated execution is an architectural m...
Lori Carter, Beth Simon, Brad Calder, Larry Carter...
PR
2010
170views more  PR 2010»
13 years 7 months ago
Sparsity preserving projections with applications to face recognition
: Dimensionality reduction methods (DRs) have commonly been used as a principled way to understand the high-dimensional data such as face images. In this paper, we propose a new un...
Lishan Qiao, Songcan Chen, Xiaoyang Tan
DLOG
2010
13 years 6 months ago
Towards Formal Comparison of Ontology Linking, Mapping and Importing
Multiple distributed and modular ontology representation frameworks have recently appeared. They typically extend Description Logics (DL), with new constructs to represent relation...
Martin Homola, Luciano Serafini
TCOM
2010
133views more  TCOM 2010»
13 years 3 months ago
Low-complexity decoding for non-binary LDPC codes in high order fields
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
Adrian Voicila, David Declercq, François Ve...
CATS
2008
13 years 10 months ago
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction
Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. These algorithms are typically more int...
Lindsay Groves