Sciweavers

1195 search results - page 209 / 239
» New constructions of SSPDs and their applications
Sort
View
CHI
2010
ACM
15 years 11 months ago
Clutching at straws: using tangible interaction to provide non-visual access to graphs
We present a tangible user interface (TUI) called Tangible Graph Builder, that has been designed to allow visually impaired users to access graph and chart-based data. We describe...
David K. McGookin, Euan Robertson, Stephen A. Brew...
FOCS
2002
IEEE
15 years 11 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
IPPS
2002
IEEE
15 years 11 months ago
Efficient Pipelining of Nested Loops: Unroll-and-Squash
The size and complexity of current custom VLSI have forced the use of high-level programming languages to describe hardware, and compiler and synthesis technology bstract designs ...
Darin Petkov, Randolph E. Harr, Saman P. Amarasing...
ITCC
2002
IEEE
15 years 11 months ago
Bridging O-Telos and XML with XML Schema: the Authoring Environment for KBS Adaptive Hyperbook
KBS Adaptive Hyperbook is a framework designed for modeling, organizing, and maintaining distributed hypermedia resources on the Web with the purpose of supporting Web-based dista...
Changtao Qu, Wolfgang Nejdl
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
15 years 10 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu