1732 search results - page 132 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
163
click to vote
DM
2011
15 years 1 months ago
2011
We prove that any k-uniform hypergraph on n vertices with minimum degree at least n 2(k−1) + o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K...
173
click to vote
WSCG
2004
15 years 7 months ago
2004
The problem of segmenting color video sequences is addressed. Boundary motion and occlusion relations expressed by labeling rules are argued to be of key importance for segmentati...
164
click to vote
JRTIP
2007
15 years 6 months ago
2007
The paper presents a real-time algorithm that compensates image distortions due to atmospheric turbulence in video sequences, while keeping the real moving objects in the video unh...
193
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are important tools in studying complex genetic traits and genome evolution. Computational strategies for SNP discovery make use...
159
click to vote
SACRYPT
2005
Springer
15 years 12 months ago
2005
Springer
Previously known techniques to construct pairing-friendly curves of prime or near-prime order are restricted to embedding degree k 6. More general methods produce curves over Fp wh...