Sciweavers

14515 search results - page 45 / 2903
» Efficient Embedded Computing
Sort
View
DCC
2010
IEEE
13 years 10 months ago
A characterization of the Grassmann embedding of H(q), with q even
In this note, we characterize the Grassmann embedding of H(q), q even, as the unique full embedding of H(q) in PG(12, q) for which each ideal line of H(q) is contained in a plane....
A. De Wispelaere, Joseph A. Thas, Hendrik Van Mald...
CF
2004
ACM
14 years 3 months ago
The happy marriage of architecture and application in next-generation reconfigurable systems
New applications and standards are first conceived only for functional correctness and without concerns for the target architecture. The next challenge is to map them onto an arch...
Ingrid Verbauwhede, Patrick Schaumont
EGH
2010
Springer
13 years 8 months ago
AnySL: efficient and portable shading for ray tracing
While a number of different shading languages have been developed, their efficient integration into an existing renderer is notoriously difficult, often boiling down to implementi...
Ralf Karrenberg, Dmitri Rubinstein, Philipp Slusal...
FOCS
2004
IEEE
14 years 1 months ago
Approximating Edit Distance Efficiently
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
JGAA
2006
75views more  JGAA 2006»
13 years 10 months ago
Upward Planar Drawings and Switch-regularity Heuristics
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to def...
Walter Didimo