Sciweavers

3267 search results - page 294 / 654
» Generalized quasirandom graphs
Sort
View
CORR
2006
Springer
164views Education» more  CORR 2006»
15 years 6 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
JGT
2008
69views more  JGT 2008»
15 years 6 months ago
List colorings with measurable sets
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
Jan Hladký, Daniel Král, Jean-S&eacu...
MTA
2006
156views more  MTA 2006»
15 years 6 months ago
DAG-based visual interfaces for navigation in indexed video content
Indexing and segmenting of video content by motion, color and texture has been intensively explored leading to a usual representation in a storyboard. In this paper, a novel metho...
Maylis Delest, Anthony Don, Jenny Benois-Pineau
SIGARCH
2008
94views more  SIGARCH 2008»
15 years 6 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
TCS
2008
15 years 6 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven