Sciweavers

1161 search results - page 191 / 233
» Efficient search engine measurements
Sort
View
CIKM
2006
Springer
14 years 1 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
CC
2008
Springer
13 years 11 months ago
Generating SIMD Vectorized Permutations
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...
Franz Franchetti, Markus Püschel
LREC
2010
123views Education» more  LREC 2010»
13 years 11 months ago
Querying Diverse Treebanks in a Uniform Way
This paper presents a system for querying treebanks in a uniform way. The system is able to work with both dependency and constituency based treebanks in any language. We demonstr...
Jan Stepánek, Petr Pajas
SDM
2007
SIAM
145views Data Mining» more  SDM 2007»
13 years 11 months ago
Finding Motifs in a Database of Shapes
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...
Xiaopeng Xi, Eamonn J. Keogh, Li Wei, Agenor Mafra...
EACL
2006
ACL Anthology
13 years 11 months ago
Constraints on Non-Projective Dependency Parsing
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
Joakim Nivre