Sciweavers

3946 search results - page 37 / 790
» The computational complexity of choice sets
Sort
View
IPPS
2006
IEEE
16 years 5 days ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
AMAI
2004
Springer
15 years 6 months ago
Logical Preference Representation and Combinatorial Vote
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
Jérôme Lang
IPPS
2000
IEEE
15 years 10 months ago
Augmenting Modern Superscalar Architectures with Configurable Extended Instructions
The instruction sets of general-purpose microprocessors are designed to offer good performance across a wide range of programs. The size and complexity of the instruction sets, how...
Xianfeng Zhou, Margaret Martonosi
PRL
2006
98views more  PRL 2006»
15 years 6 months ago
Data complexity assessment in undersampled classification of high-dimensional biomedical data
Regularized linear classifiers have been successfully applied in undersampled, i.e. small sample size/high dimensionality biomedical classification problems. Additionally, a desig...
Richard Baumgartner, Ray L. Somorjai
ICIP
2004
IEEE
16 years 7 months ago
Learning structured dictionaries for image representation
The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effec...
Gianluca Monaci, Pierre Vandergheynst