Sciweavers

2783 search results - page 407 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
FROCOS
2000
Springer
15 years 5 months ago
Handling Differential Equations with Constraints for Decision Support
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
Jorge Cruz, Pedro Barahona
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
15 years 5 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong
FSTTCS
2000
Springer
15 years 5 months ago
Text Sparsification via Local Maxima
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Gr...
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 5 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
NGC
2000
Springer
109views Communications» more  NGC 2000»
15 years 5 months ago
Router level filtering for receiver interest delivery
Delivering data to on-line game participants requires the game data to be "customized" in real-time to each participant's characteristics. Using multicast in such a...
Manuel M. Oliveira, Jon Crowcroft, Christophe Diot