Sciweavers

1051 search results - page 160 / 211
» Fundamental Challenges in Mobile Computing
Sort
View
ICS
2010
Tsinghua U.
14 years 2 months ago
Small-ruleset regular expression matching on GPGPUs: quantitative performance analysis and optimization
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
Jamin Naghmouchi, Daniele Paolo Scarpazza, Mladen ...
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
14 years 1 months ago
Two Algorithms for LCS Consecutive Suffix Alignment
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
LREC
2010
127views Education» more  LREC 2010»
13 years 11 months ago
Expanding the Lexicon for a Resource-Poor Language Using a Morphological Analyzer and a Web Crawler
Resource-poor languages may suffer from a lack of any of the basic resources that are fundamental to computational linguistics, including an adequate digital lexicon. Given the re...
Michael Gasser
ICWS
2008
IEEE
13 years 11 months ago
Dynamic Availability Estimation for Service Selection Based on Status Identification
With the popularity of Service-Oriented Computing, how to construct highly available service-oriented applications is becoming a hot topic in both the research and industry commun...
Lingshuang Shao, Lu Zhang, Tao Xie, Junfeng Zhao, ...
OPODIS
2003
13 years 11 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...