102 search results - page 1 / 21 » Set systems without a simplex or a cluster |
117
Voted
COMBINATORICA
2010
15 years 1 months ago
2010
86
Voted
SIAMDM
2010
14 years 10 months ago
2010
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...
162
Voted
CVPR
2003
IEEE
15 years 9 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
122
Voted
RECSYS
2009
ACM
15 years 10 months ago
2009
ACM
This thesis investigates application of clustering to multi-criteria ratings as a method of improving the precision of top-N recommendations. With the advent of ecommerce sites th...
163
Voted
PVLDB
2010
15 years 2 months ago
2010
MapReduce is a computing paradigm that has gained a lot of attention in recent years from industry and research. Unlike parallel DBMSs, MapReduce allows non-expert users to run co...