22 search results - page 3 / 5 » On the Advantage over Random for Maximum Acyclic Subgraph |
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hid...
JMLR
2008
13 years 7 months ago
2008
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...