Sciweavers

1147 search results - page 151 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
SADM
2008
90views more  SADM 2008»
13 years 8 months ago
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, J&e...
COMPGEOM
2009
ACM
14 years 3 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
FOCS
1999
IEEE
14 years 1 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
CVPR
2004
IEEE
14 years 11 months ago
Bayesian Fusion of Camera Metadata Cues in Semantic Scene Classification
Semantic scene classification based only on low-level vision cues has had limited success on unconstrained image sets. On the other hand, camera metadata related to capture condit...
Matthew R. Boutell, Jiebo Luo
BMCBI
2011
13 years 3 months ago
PheMaDB: A solution for storage, retrieval, and analysis of high throughput phenotype data
Background: OmniLog™ phenotype microarrays (PMs) have the capability to measure and compare the growth responses of biological samples upon exposure to hundreds of growth condit...
Wenling E. Chang, Keri Sarver, Brandon W. Higgs, T...