32 search results - page 4 / 7 » mst 2007 |
MST
2007
14 years 9 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
MST
2007
14 years 9 months ago
2007
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...
MST
2007
14 years 9 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
67
Voted
MST
2007
14 years 9 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
ACL
2007
14 years 11 months ago
2007
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored ...