28 search results - page 5 / 6 » Problem Kernels for NP-Complete Edge Deletion Problems: Spli... |
TCAD
2010
13 years 1 days ago
2010
Abstract--In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different ex...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
DAM
2010
13 years 5 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
COLT
2010
Springer
13 years 3 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...