Sciweavers

62 search results - page 3 / 13
» Optimizing the cost matrix for approximate string matching u...
Sort
View
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
12 years 9 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
CORR
2010
Springer
87views Education» more  CORR 2010»
13 years 3 months ago
Using Evolution Strategy with Meta-models for Well Placement Optimization
Optimum implementation of non-conventional wells allows us to increase considerably hydrocarbon recovery. By considering the high drilling cost and the potential improvement in we...
Zyed Bouzarkouna, Didier Yu Ding, Anne Auger
CIKM
2001
Springer
13 years 9 months ago
Improved String Matching Under Noisy Channel Conditions
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
Kevyn Collins-Thompson, Charles Schweizer, Susan T...
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
13 years 10 months ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
CEC
2005
IEEE
13 years 11 months ago
FPGA segmented channel routing using genetic algorithms
A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA's) is presented in this paper. The FPGA segmented channel routing problem (F...
Lipo Wang, Lei Zhou, Wen Liu