Sciweavers

2314 search results - page 100 / 463
» Minimal Partitions of a Graph
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 4 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
153
Voted
ASPDAC
2010
ACM
637views Hardware» more  ASPDAC 2010»
15 years 1 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...
155
Voted
ICIP
2005
IEEE
16 years 5 months ago
Level set curve evolution partitioning of polarimetric images
We investigate a method of segmentation of multichannel polarimetric images, such as in laser illuminated or synthetic aperture radar, into a given but arbitrary number of regions...
Ismail Ben Ayed, Amar Mitiche, Ziad Belhadj
175
Voted
FOCS
2005
IEEE
15 years 9 months ago
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ic...
159
Voted
PE
2011
Springer
167views Optimization» more  PE 2011»
14 years 10 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...