Sciweavers

697 search results - page 32 / 140
» Approximation of Information Granule Sets
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 10 days ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
UAI
2008
15 years 1 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
BMCBI
2008
130views more  BMCBI 2008»
14 years 12 months ago
Function approximation approach to the inference of reduced NGnet models of genetic networks
Background: The inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of m...
Shuhei Kimura, Katsuki Sonoda, Soichiro Yamane, Hi...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 4 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
ICICS
2004
Springer
15 years 5 months ago
Hydan: Hiding Information in Program Binaries
We present a scheme to steganographically embed information in x86 program binaries. We define sets of functionally-equivalent instructions, and use a key-derived selection proces...
Rakan El-Khalil, Angelos D. Keromytis