Sciweavers

201 search results - page 22 / 41
» Rough Set Approximation Based on Dynamic Granulation
Sort
View
VLUDS
2010
187views Visualization» more  VLUDS 2010»
13 years 3 months ago
On Moving Least Squares Based Flow Visualization
Modern simulation and measurement methods tend to produce meshfree data sets if modeling of processes or objects with free surfaces or boundaries is desired. In Computational Flui...
Harald Obermaier, Martin Hering-Bertram, Jörg...
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
14 years 2 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 8 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
ATAL
2005
Springer
14 years 2 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
JCO
2011
115views more  JCO 2011»
13 years 3 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu