Sciweavers

11211 search results - page 400 / 2243
» Rank-Sensitive Data Structures
Sort
View
SYNTHESE
2011
79views more  SYNTHESE 2011»
15 years 1 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 10 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 6 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
CIKM
2011
Springer
14 years 6 months ago
Keyword search over RDF graphs
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...
Shady Elbassuoni, Roi Blanco
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
14 years 6 months ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...