70 search results - page 1 / 14 » An Exact Characterization of Greedy Structures |
IPCO
1992
14 years 9 hour ago
1992
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
MFCS
2009
Springer
14 years 5 months ago
2009
Springer
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
CSL
2008
Springer
14 years 19 days ago
2008
Springer
We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hypercliqu...