Sciweavers

2089 search results - page 15 / 418
» A New Problem in String Searching
Sort
View
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
14 years 11 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
ACL
2012
13 years 22 hour ago
String Re-writing Kernel
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referre...
Fan Bu, Hang Li, Xiaoyan Zhu
GECCO
2006
Springer
116views Optimization» more  GECCO 2006»
15 years 1 months ago
A crossover for complex building blocks overlapping
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
JIPS
2008
130views more  JIPS 2008»
14 years 9 months ago
Inverted Index based Modified Version of KNN for Text Categorization
: This research proposes a new strategy where documents are encoded into string vectors and modified version of KNN to be adaptable to string vectors for text categorization. Tradi...
Taeho Jo
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
14 years 9 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro