Sciweavers

50 search results - page 1 / 10
» Set Systems without a Strong Simplex
Sort
View
SIAMDM
2010
87views more  SIAMDM 2010»
12 years 11 months ago
Set Systems without a Strong Simplex
A d-simplex is a collection of d + 1 sets such that every d of them have non-empty intersection and the intersection of all of them is empty. A strong d-simplex is a collection of...
Tao Jiang, Oleg Pikhurko, Zelealem Yilma
COMBINATORICA
2010
13 years 2 months ago
Set systems without a simplex or a cluster
Peter Keevash, Dhruv Mubayi
ISCA
2007
IEEE
149views Hardware» more  ISCA 2007»
13 years 11 months ago
An effective hybrid transactional memory system with strong isolation guarantees
We propose signature-accelerated transactional memory (SigTM), a hybrid TM system that reduces the overhead of software transactions. SigTM uses hardware signatures to track the r...
Chi Cao Minh, Martin Trautmann, JaeWoong Chung, Au...
ATAL
2010
Springer
13 years 5 months ago
Strategy-proof allocation of multiple items between two agents without payments or priors
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
Mingyu Guo, Vincent Conitzer
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
13 years 10 months ago
Memetic Optimization of Video Chain Designs
Abstract. Improving image quality is the backbone of highly competitive display industry. Contemporary video processing system design is a challenging optimization problem. General...
Walid Ali, Alexander P. Topchy