Sciweavers

143 search results - page 28 / 29
» How to rank with few errors
Sort
View
SMALLTALK
2007
Springer
14 years 2 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
14 years 1 days ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
MOBISYS
2010
ACM
13 years 11 months ago
CrowdSearch: exploiting crowds for accurate real-time image search on mobile phones
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
Tingxin Yan, Vikas Kumar, Deepak Ganesan
MLMTA
2007
13 years 10 months ago
Prediction of Protein Secondary Structures with a Novel Kernel Density Estimator
- Though prediction of protein secondary structures has been an active research issue in bioinformatics for quite a few years and many approaches have been proposed, a new challeng...
Yen-Jen Oyang, Darby Tien-Hao Chang, Yu-Yen Ou, Ha...
CORR
2007
Springer
158views Education» more  CORR 2007»
13 years 8 months ago
Multi-group ML Decodable Collocated and Distributed Space Time Block Codes
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
G. Susinder Rajan, B. Sundar Rajan