Sciweavers

1147 search results - page 212 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 7 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
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
14 years 2 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
BMCBI
2010
118views more  BMCBI 2010»
13 years 7 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 ...
WCRE
2010
IEEE
13 years 6 months ago
Software Process Recovery: Recovering Process from Artifacts
—Often stakeholders, such as developers, managers, or buyers, want to find out what software development processes are being followed within a software project. Their reasons in...
Abram Hindle
JMLR
2012
11 years 10 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio