Sciweavers

583 search results - page 45 / 117
» New algorithms for efficient parallel string comparison
Sort
View
WWW
2009
ACM
16 years 3 months ago
Exploiting web search to generate synonyms for entities
Tasks recognizing named entities such as products, people names, or locations from documents have recently received significant attention in the literature. Many solutions to thes...
Surajit Chaudhuri, Venkatesh Ganti, Dong Xin
235
Voted
JCDL
2011
ACM
374views Education» more  JCDL 2011»
14 years 5 months ago
Comparative evaluation of text- and citation-based plagiarism detection approaches using guttenplag
Various approaches for plagiarism detection exist. All are based on more or less sophisticated text analysis methods such as string matching, fingerprinting or style comparison. I...
Bela Gipp, Norman Meuschke, Jöran Beel
141
Voted
HPCC
2005
Springer
15 years 8 months ago
Efficient SIMD Numerical Interpolation
This paper reports the results of SIMD implementation of a number of interpolation algorithms on common personal computers. These methods fit a curve on some given input points for...
Hossein Ahmadi, Maryam Moslemi Naeini, Hamid Sarba...
ACSC
2002
IEEE
15 years 7 months ago
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
Krisztián Monostori, Arkady B. Zaslavsky, H...
254
Voted
ASPLOS
2009
ACM
16 years 3 months ago
Kendo: efficient deterministic multithreading in software
Although chip-multiprocessors have become the industry standard, developing parallel applications that target them remains a daunting task. Non-determinism, inherent in threaded a...
Marek Olszewski, Jason Ansel, Saman P. Amarasinghe