Sciweavers

3020 search results - page 450 / 604
» Optimal partition trees
Sort
View
IPL
1998
119views more  IPL 1998»
15 years 6 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
15 years 5 months ago
Simulation-based LQR-trees with input and state constraints
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
Philipp Reist, Russ Tedrake
EMNLP
2010
15 years 4 months ago
Title Generation with Quasi-Synchronous Grammar
The task of selecting information and rendering it appropriately appears in multiple contexts in summarization. In this paper we present a model that simultaneously optimizes sele...
Kristian Woodsend, Yansong Feng, Mirella Lapata
IPPS
2010
IEEE
15 years 4 months ago
Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...
Bo Zhang, Binoy Ravindran
NAACL
2010
15 years 4 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad