656 search results - page 84 / 132 » Marrying Words and Trees |
119
click to vote
ADHOCNETS
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we consider the use of multiple mobile software agents to perform different tasks in wireless sensor networks (WSNs). To this regard, determining the number of mobil...
137
click to vote
NAACL
2010
14 years 9 months ago
2010
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...
ACL
2009
14 years 9 months ago
2009
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
135
click to vote
WACV
2012
IEEE
13 years 7 months ago
2012
IEEE
We present a novel algorithm, Compact Kd-Trees (CompactKdt), that achieves state-of-the-art performance in searching large scale object image collections. The algorithm uses an or...
101
click to vote
RECOMB
2006
Springer
16 years 4 days ago
2006
Springer
Abstract. Given a phylogenetic tree T for a family of tandemly repeated genes and their signed order O on the chromosome, we aim to find the minimum number of inversions compatible...