Sciweavers

11213 search results - page 285 / 2243
» Low-contention data structures
Sort
View
AAAI
2011
14 years 6 months ago
Integrating Community Question and Answer Archives
Question and answer pairs in Community Question Answering (CQA) services are organized into hierarchical structures or taxonomies to facilitate users to find the answers for thei...
Wei Wei, Gao Cong, Xiaoli Li, See-Kiong Ng, Guohui...
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
15 years 4 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro
VLSISP
2011
223views Database» more  VLSISP 2011»
15 years 1 months ago
Wideband Beamspace Processing Using Orthogonal Modal Beamformers
We introduce a novel beamspace processing structure that can be used for narrowband or wideband sources located either in nearfield or farfield of a sensor array. Main features o...
Thushara D. Abhayapala, Darren B. Ward
WWW
2011
ACM
15 years 1 months ago
HyLiEn: a hybrid approach to general list extraction on the web
We consider the problem of automatically extracting general lists from the web. Existing approaches are mostly dependent upon either the underlying HTML markup or the visual struc...
Fabio Fumarola, Tim Weninger, Rick Barber, Donato ...
JMLR
2010
139views more  JMLR 2010»
15 years 1 months ago
Causal learning without DAGs
Causal learning methods are often evaluated in terms of their ability to discover a true underlying directed acyclic graph (DAG) structure. However, in general the true structure ...
David Duvenaud, Daniel Eaton, Kevin P. Murphy, Mar...