Sciweavers

815 search results - page 62 / 163
» Approximate Entropy Reducts
Sort
View
SIROCCO
2008
15 years 1 months ago
Computing Approximate Nash Equilibria in Network Congestion Games
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
Andreas Emil Feldmann, Heiko Röglin, Berthold...
QUESTA
1998
93views more  QUESTA 1998»
14 years 11 months ago
An approximation method for complete solutions of Markov-modulated fluid models
This paper presents an approximation method for numerically solving general Markov modulated fluid models which are widely used in modelling communications and computer systems. ...
David D. McDonald, Kun Qian
KBS
2008
98views more  KBS 2008»
14 years 10 months ago
Mixed feature selection based on granulation and approximation
Feature subset selection presents a common challenge for the applications where data with tens or hundreds of features are available. Existing feature selection algorithms are mai...
Qinghua Hu, Jinfu Liu, Daren Yu
DASFAA
2008
IEEE
150views Database» more  DASFAA 2008»
15 years 6 months ago
Approximate Clustering of Time Series Using Compact Model-Based Descriptions
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
15 years 5 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...