1302 search results - page 39 / 261 » On the Strong Chromatic Number |
143
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
174
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
186
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
193
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
Over the last decades fiducial markers have provided widely adopted tools to add reliable model-based features into an otherwise general scene. Given their central role in many c...
148
click to vote
DCC
2007
IEEE
16 years 5 months ago
2007
IEEE
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...