Sciweavers

3172 search results - page 463 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
DBPL
2007
Springer
101views Database» more  DBPL 2007»
15 years 10 months ago
Efficient Inclusion for a Class of XML Types with Interleaving and Counting
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleavin...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
HPCS
2009
IEEE
15 years 10 months ago
FFT-Based Dense Polynomial Arithmetic on Multi-cores
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
Marc Moreno Maza, Yuzhen Xie
3DPVT
2004
IEEE
131views Visualization» more  3DPVT 2004»
15 years 10 months ago
Viewpoint Consistent Texture Synthesis
The purpose of this work is to synthesize textures of rough, real world surfaces under freely chosen viewing and illumination directions. Moreover, such textures are produced for ...
Alexander Neubeck, Alexey Zalesny, Luc J. Van Gool
AIS
2004
Springer
15 years 10 months ago
Timed I/O Test Sequences for Discrete Event Model Verification
Abstract. Model verification examines the correctness of a model implementation with respect to a model specification. While being described from model specification, implementatio...
Ki Jung Hong, Tag Gon Kim
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
15 years 10 months ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...