Sciweavers

893 search results - page 170 / 179
» Statistical timing analysis using Kernel smoothing
Sort
View
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
14 years 5 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
ATAL
2010
Springer
13 years 11 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
BMCBI
2010
118views more  BMCBI 2010»
13 years 10 months ago
svdPPCS: an effective singular value decomposition-based method for conserved and divergent co-expression gene module identifica
Background: Comparative analysis of gene expression profiling of multiple biological categories, such as different species of organisms or different kinds of tissue, promises to e...
Wensheng Zhang, Andrea Edwards, Wei Fan, Dongxiao ...
BMCBI
2007
148views more  BMCBI 2007»
13 years 10 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...