Sciweavers

3151 search results - page 425 / 631
» Using query term order for result summarisation
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 10 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
CIKM
2008
Springer
15 years 8 months ago
Non-local evidence for expert finding
The task addressed in this paper, finding experts in an enterprise setting, has gained in importance and interest over the past few years. Commonly, this task is approached as an ...
Krisztian Balog, Maarten de Rijke
ICDE
2002
IEEE
164views Database» more  ICDE 2002»
16 years 7 months ago
Towards Meaningful High-Dimensional Nearest Neighbor Search by Human-Computer Interaction
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
Charu C. Aggarwal
ICSM
2007
IEEE
16 years 24 days ago
Design recovery and maintenance of build systems
The build system forms an indispensable part of any software project. It needs to evolve in parallel with the source code in order to build, test and install the software. Unfortu...
Bram Adams, Herman Tromp, Kris De Schutter, Wolfga...
SEMWEB
2007
Springer
16 years 18 days ago
WWWatch: Watching the World in Different Views with Semantic Web
This paper develops a Semantic Web application, namely WorldWideWatch or WWWatch, in short. By employment of Semantic Web technologies, WWWatch analyses and visualizes social netwo...
Ekgarach Sumsiripong, Krissada Maleewong, Rachanee...