Sciweavers

406 search results - page 68 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
IPPS
2008
IEEE
14 years 4 months ago
Design of steering vectors for dynamically reconfigurable architectures
An architectural framework is studied that can perform dynamic reconfiguration. A basic objective is to dynamically reconfigure the architecture so that its configuration is well ...
Nick A. Mould, Brian F. Veale, John K. Antonio, Mo...
IEEEPACT
2007
IEEE
14 years 4 months ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
ACSC
2005
IEEE
14 years 3 months ago
The Electronic Primaries: Predicting the U.S. Presidency Using Feature Selection with Safe Data Reduction
The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples ...
Pablo Moscato, Luke Mathieson, Alexandre Mendes, R...
MM
2005
ACM
143views Multimedia» more  MM 2005»
14 years 3 months ago
Hierarchical voting classification scheme for improving visual sign language recognition
As one of the important research areas of multimodal interaction, sign language recognition (SLR) has attracted increasing interest. In SLR, especially on medium or large vocabula...
Liang-Guo Zhang, Xilin Chen, Chunli Wang, Wen Gao
PPOPP
2005
ACM
14 years 3 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber