Sciweavers

1127 search results - page 211 / 226
» Testing the Expansion of a Graph
Sort
View
SIAMJO
2002
142views more  SIAMJO 2002»
14 years 9 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
ECCC
2008
93views more  ECCC 2008»
14 years 9 months ago
A Note on the Distance to Monotonicity of Boolean Functions
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
Arnab Bhattacharyya
ASPDAC
2010
ACM
637views Hardware» more  ASPDAC 2010»
14 years 7 months ago
A new graph-theoretic, multi-objective layout decomposition framework for double patterning lithography
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
Jae-Seok Yang, Katrina Lu, Minsik Cho, Kun Yuan, D...
BMCBI
2010
201views more  BMCBI 2010»
14 years 7 months ago
IntelliGO: a new vector-based semantic similarity measure including annotation origin
Background: The Gene Ontology (GO) is a well known controlled vocabulary describing the biological process, molecular function and cellular component aspects of gene annotation. I...
Sidahmed Benabderrahmane, Malika Smaïl-Tabbon...
102
Voted
SIGSOFT
2010
ACM
14 years 4 months ago
Path-based fault correlations
Although a number of automatic tools have been developed to detect faults, much of the diagnosis is still being done manually. To help with the diagnostic tasks, we formally intro...
Wei Le, Mary Lou Soffa