Sciweavers

250 search results - page 24 / 50
» The Art of the Possible
Sort
View
CONCUR
2008
Springer
14 years 11 months ago
A Scalable and Oblivious Atomicity Assertion
Abstract. This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register imp...
Rachid Guerraoui, Marko Vukolic
PRL
2008
161views more  PRL 2008»
14 years 9 months ago
Automatic kernel clustering with a Multi-Elitist Particle Swarm Optimization Algorithm
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
Swagatam Das, Ajith Abraham, Amit Konar
89
Voted
ICCV
2009
IEEE
1318views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Non-Local Sparse Models for Image Restoration
We propose in this paper to unify two different ap- proaches to image restoration: On the one hand, learning a basis set (dictionary) adapted to sparse signal descriptions has p...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
SIGIR
2012
ACM
13 years 3 days ago
Explicit relevance models in intent-oriented information retrieval diversification
The intent-oriented search diversification methods developed in the field so far tend to build on generative views of the retrieval system to be diversified. Core algorithm compon...
Saul Vargas, Pablo Castells, David Vallet
BMCBI
2006
120views more  BMCBI 2006»
14 years 9 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...