Sciweavers

2314 search results - page 405 / 463
» Monoids over domains
Sort
View
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 13 days ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
SPAA
2009
ACM
16 years 11 days ago
Towards transactional memory semantics for C++
Transactional memory (TM) eliminates many problems associated with lock-based synchronization. Over recent years, much progress has been made in software and hardware implementati...
Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert ...
KDD
2009
ACM
209views Data Mining» more  KDD 2009»
16 years 11 days ago
Collective annotation of Wikipedia entities in web text
To take the first step beyond keyword-based search toward entity-based search, suitable token spans ("spots") on documents must be identified as references to real-world...
Sayali Kulkarni, Amit Singh, Ganesh Ramakrishnan, ...
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
16 years 11 days ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 11 days ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...