1922 search results - page 185 / 385 » ie 2007 |
146
click to vote
JCT
2007
15 years 6 months ago
2007
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
165
click to vote
JCT
2007
15 years 6 months ago
2007
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
151
click to vote
JGT
2007
15 years 6 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
138
click to vote
JMM2
2007
15 years 6 months ago
2007
— In this paper we are proposing an improved cut detection algorithm adapted to the animation movies domain. A cut is the direct concatenation of two different shots and produces...
152
click to vote
4OR
2004
15 years 6 months ago
2004
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...