173 search results - page 28 / 35 » Every color chromakey |
73
Voted
COMBINATORICA
2007
14 years 11 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
ICIP
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper presents the implementation details of a coded structured light system for rapid shape acquisition of unknown surfaces. Such techniques are based on the projection of p...
ICCAD
2007
IEEE
2007
IEEE
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
15 years 8 months ago
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
EJC
2007
14 years 11 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
84
Voted
ICPR
2002
IEEE
16 years 25 days ago
2002
IEEE
We present a method to classify movies on the basis of audio-visual cues present in the previews. A preview summarizes the main idea of a movie providing suitable amount of inform...