1732 search results - page 44 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
164
click to vote
JCT
1998
15 years 5 months ago
1998
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
169
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
171
click to vote
JSCIC
2010
15 years 29 days ago
2010
This paper considers highly ill-posed surface recovery inverse problems, where the sought surface in 2D or 3D is piecewise constant with several possible level values. These level...
176
click to vote
IEEESCC
2005
IEEE
15 years 11 months ago
2005
IEEE
Two practical paradigms are presented, which facilitate domain concepts to be directly used to model business operations: the first paradigm is based on the business artifacts and...
177
click to vote
EJC
2007
15 years 6 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...