Sciweavers

383 search results - page 60 / 77
» A Bound on the Total Chromatic Number
Sort
View
ICCAD
2006
IEEE
95views Hardware» more  ICCAD 2006»
14 years 4 months ago
Robust estimation of parametric yield under limited descriptions of uncertainty
Reliable prediction of parametric yield for a specific design is difficult; a significant reason is the reliance of the yield estimation methods on the hard-to-measure distributio...
Wei-Shen Wang, Michael Orshansky
WABI
2009
Springer
14 years 2 months ago
MADMX: A Novel Strategy for Maximal Dense Motif Extraction
We develop, analyze and experiment with a new tool, called madmx, which extracts frequent motifs, possibly including don’t care characters, from biological sequences. We introduc...
Roberto Grossi, Andrea Pietracaprina, Nadia Pisant...
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 2 months ago
On the structure of graph edge designs that optimize the algebraic connectivity
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...
FOCS
2006
IEEE
14 years 1 months ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen