Sciweavers

253 search results - page 43 / 51
» The Sketching Complexity of Pattern Matching
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
Robert Hall, Arnold L. Rosenberg, Arun Venkatarama...
FCT
2005
Springer
14 years 27 days 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, ...
IPPS
2000
IEEE
13 years 11 months ago
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
Yuanyuan Yang, Jianchao Wang
COOPIS
1998
IEEE
13 years 11 months ago
A Generative Communication Service for Database Interoperability
Parallel and distributed programming is conceptually harder to undertake and to understand than sequential programming, because a programmer often has to manage the coexistence an...
Wilhelm Hasselbring, Mark Roantree
VTS
1997
IEEE
73views Hardware» more  VTS 1997»
13 years 11 months ago
Obtaining High Fault Coverage with Circular BIST Via State Skipping
Despite all of the advantages that circular BIST ofsers compared to conventional BIST approaches in terms of low area overhead, simple control logic, and easy insertion, it has se...
Nur A. Touba