Sciweavers

815 search results - page 28 / 163
» Approximate Entropy Reducts
Sort
View
IJBC
2010
77views more  IJBC 2010»
14 years 6 months ago
Starting homoclinic Tangencies Near 1 : 1 resonances
We construct a theory-based numerical method for starting the continuation of homoclinic tangencies near 1 : 1 resonances, for systems with arbitrary dimension 2. The core of the ...
Joseph Páez Chávez
AAECC
1995
Springer
92views Algorithms» more  AAECC 1995»
15 years 3 months ago
Division of Entire Functions by Polynomial Ideals
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
Joachim Apel
IJON
1998
158views more  IJON 1998»
14 years 11 months ago
Bayesian Kullback Ying-Yang dependence reduction theory
Bayesian Kullback Ying—Yang dependence reduction system and theory is presented. Via stochastic approximation, implementable algorithms and criteria are given for parameter lear...
Lei Xu
ACSC
2009
IEEE
15 years 6 months ago
Microdata Protection Through Approximate Microaggregation
Microdata protection is a hot topic in the field of Statistical Disclosure Control, which has gained special interest after the disclosure of 658000 queries by the America Online...
Xiaoxun Sun, Hua Wang, Jiuyong Li
FOCS
2004
IEEE
15 years 3 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot