3 search results - page 1 / 1 » On-line Chain Partitioning of Up-growing Interval Orders |
ORDER
2007
13 years 4 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
IPPS
2002
IEEE
13 years 9 months ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
JCT
2010
13 years 3 months ago
2010
We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Sch¨utzenberger’s jeu de taquin....