2542 search results - page 129 / 509 » integration 2010 |
ECTEL
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We present a simple and extendible framework to collect attention metadata and store them for further analysis. Currently, several metadata collectors have been implement...
ORL
2010
14 years 9 months ago
2010
We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these ...
SIAMDM
2010
14 years 9 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
102
click to vote
ACL
2010
14 years 9 months ago
2010
A characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is...
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
This article is a survey of developments in algorithmic convex geometry over the past decade. These include algorithms for sampling, optimization, integration, rounding and learni...