Sciweavers

3396 search results - page 516 / 680
» Tree representations of graphs
Sort
View
132
Voted
LREC
2010
180views Education» more  LREC 2010»
15 years 6 months ago
A Comprehensive Resource to Evaluate Complex Open Domain Question Answering
We describe two corpora of question and answer pairs collected for complex, open-domain Question Answering (QA) to enable answer classification and re-ranking experiments. We deli...
Silvia Quarteroni, Alessandro Moschitti
EACL
2006
ACL Anthology
15 years 6 months ago
Online Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
Ryan T. McDonald, Fernando C. N. Pereira
131
Voted
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 6 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
WSC
2004
15 years 6 months ago
Simulating Growth Dynamics in Complex Adaptive Supply Networks
This paper discusses an extended adaptive supply network simulation model that explicitly captures growth (in terms of change in size over time, and birth and death) based on Utte...
Surya Dev Pathak, David M. Dilts, Gautam Biswas
WSCG
2004
197views more  WSCG 2004»
15 years 6 months ago
Collision Prediction Using MKtrees
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
Marta Franquesa-Niubó, Pere Brunet