Sciweavers

365 search results - page 19 / 73
» On the combinatorics of Galois numbers
Sort
View
KDID
2004
140views Database» more  KDID 2004»
15 years 1 months ago
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
Jérémy Besson, Céline Robarde...
COMBINATORICS
1999
83views more  COMBINATORICS 1999»
14 years 11 months ago
New Lower Bounds for Some Multicolored Ramsey Numbers
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
Aaron Robertson
COCOON
2009
Springer
14 years 9 months ago
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
George Karakostas, Stavros G. Kolliopoulos, Jing W...
COMBINATORICS
2006
153views more  COMBINATORICS 2006»
14 years 12 months ago
BG-Ranks and 2-Cores
We find the number of partitions of n whose BG-rank is j, in terms of pp(n), the number of pairs of partitions whose total number of cells is n, giving both bijective and generati...
William Y. C. Chen, Kathy Q. Ji, Herbert S. Wilf
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
14 years 12 months ago
Matchings Avoiding Partial Patterns
We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on t...
William Y. C. Chen, Toufik Mansour, Sherry H. F. Y...