1963 search results - page 44 / 393 » The Maximum Solution Problem on Graphs |
145
click to vote
NIPS
2007
15 years 3 months ago
2007
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
163
Voted
JMLR
2012
13 years 5 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
135
Voted
ISPD
2010
ACM
15 years 9 months ago
2010
ACM
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
89
Voted
TNN
2008
15 years 2 months ago
2008
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
126
Voted
ALGORITHMICA
2002
15 years 2 months ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...