Sciweavers

1087 search results - page 186 / 218
» Eta-Redexes in Partial Evaluation
Sort
View
TIT
2008
164views more  TIT 2008»
13 years 8 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
SAS
1999
Springer
106views Formal Methods» more  SAS 1999»
14 years 23 days ago
Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
This paper presents and evaluates a set of analyses designed to reduce synchronization overhead in Java programs. Monitor-based synchronization in Java often causes significant ove...
Jonathan Aldrich, Craig Chambers, Emin Gün Si...
INFOVIS
1998
IEEE
14 years 23 days ago
Similarity Clustering of Dimensions for an Enhanced Visualization of Multidimensional Data
The order and arrangement of dimensions (variates) is crucial for the effectiveness of a large number of visualization techniques such as parallel coordinates, scatterplots, recur...
Mihael Ankerst, Stefan Berchtold, Daniel A. Keim
AGP
1997
IEEE
14 years 22 days ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
CVPR
1997
IEEE
14 years 22 days ago
Automatic line matching across views
This paper presents a new method for matching individual line segments between images. The method uses both greylevel information and the multiple view geometric relations between...
Cordelia Schmid, Andrew Zisserman