Sciweavers

2089 search results - page 18 / 418
» A New Problem in String Searching
Sort
View
MAM
2008
150views more  MAM 2008»
14 years 9 months ago
FPGA based string matching for network processing applications
String matching is a key problem in many network processing applications. Current implementations of this process using software are time consuming and cannot meet gigabit bandwid...
Janardhan Singaraju, John A. Chandy
IPPS
2006
IEEE
15 years 3 months ago
Implementation of a programmable array processor architecture for approximate string matching algorithms on FPGAs
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...
DSS
2007
122views more  DSS 2007»
14 years 9 months ago
A stochastic beam search for the berth allocation problem
Abstract. In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new stochastic beam search algo...
Fan Wang, Andrew Lim
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
15 years 1 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola
IPM
2008
90views more  IPM 2008»
14 years 9 months ago
Local relational string and mutual matching for image retrieval
Exhibiting new features and likely related matching techniques to efficiently retrieve images from databases remains an open problem. This paper is first devoted to such a novel d...
Adel Hafiane, Bertrand Zavidovique