Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

SIAMDM
2010

favoriteEmaildiscussreport

87views more SIAMDM 2010»

Set Systems without a Strong Simplex

12 years 11 months ago

Set Systems without a Strong Simplex

Download www.users.muohio.edu

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 d + 2 sets A, A1, . . . , Ad+1 such that {A1, . . . , Ad+1} is a d-simplex, while A contains

Tao Jiang, Oleg Pikhurko, Zelealem Yilma

Real-time Traffic

Non-empty Intersection | SIAMDM 2010 |

claim paper

Related Content

» Set systems without a simplex or a cluster

» An effective hybrid transactional memory system with strong isolation guarantees

» Strategyproof allocation of multiple items between two agents without payments or priors

» Memetic Optimization of Video Chain Designs

» On the Origin of Events Branching Cells as Stubborn Sets

» Evaluation by comparing result sets in context

» FeedbackBypass A New Approach to Interactive Similarity Query Processing

» The Imalab Method for Vision Systems

» Attaching Cloud Storage to a Campus Grid Using Parrot Chirp and Hadoop

Post Info
More Details (n/a)

Added	21 May 2011
Updated	21 May 2011
Type	Journal
Year	2010
Where	SIAMDM
Authors	Tao Jiang, Oleg Pikhurko, Zelealem Yilma

Comments (0)