Sciweavers

2925 search results - page 517 / 585
» Information Complexity of Online Problems
Sort
View
158
Voted
IPPS
2006
IEEE
15 years 11 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...
ICDCS
2005
IEEE
15 years 11 months ago
On Exploring Channel Allocation in the Diverse Data Broadcasting Environment
In recent years, data broadcasting becomes a promising technique to design a mobile information system with power conservation, high scalability and high bandwidth utilization. Ho...
Hao-Ping Hung, Ming-Syan Chen
ICECCS
2005
IEEE
236views Hardware» more  ICECCS 2005»
15 years 11 months ago
Detecting Malicious JavaScript Code in Mozilla
The JavaScript language is used to enhance the clientside display of web pages. JavaScript code is downloaded into browsers and executed on-the-fly by an embedded interpreter. Br...
Oystein Hallaraker, Giovanni Vigna
WACV
2005
IEEE
15 years 11 months ago
Ensemble Methods in the Clustering of String Patterns
We address the problem of clustering of contour images from hardware tools based on string descriptions, in a comparative study of cluster combination techniques. Several clusteri...
André Lourenço, Ana L. N. Fred
FCT
2005
Springer
15 years 11 months ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...