Sciweavers

11212 search results - page 611 / 2243
» Semi-persistent Data Structures
Sort
View
EMNLP
2010
15 years 5 months ago
Evaluating the Impact of Alternative Dependency Graph Encodings on Solving Event Extraction Tasks
In state-of-the-art approaches to information extraction (IE), dependency graphs constitute the fundamental data structure for syntactic structuring and subsequent knowledge elici...
Ekaterina Buyko, Udo Hahn
APVIS
2010
15 years 2 months ago
Visual analysis of high dimensional point clouds using topological landscapes
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...
Patrick Oesterling, Christian Heine, Heike Jä...
SYNTHESE
2011
79views more  SYNTHESE 2011»
15 years 2 months ago
Underdetermination, realism and empirical equivalence
Are theories ‘underdetermined by the evidence’ in any way that should worry the scientific realist? I argue that no convincing reason has been given for thinking so. A crucial ...
John Worrall
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 11 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
CIKM
2011
Springer
14 years 7 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang