Sciweavers

142 search results - page 28 / 29
» Program obfuscation: a quantitative approach
Sort
View
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 7 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
ICIW
2008
IEEE
14 years 1 months ago
Evaluating the Use of AOP and MDA in Web Service Development
— Model-Driven Architecture (MDA) is introduced to shorten the software development time, produce better quality of code and promote the reuse of software artifacts. On the other...
Guadalupe Ortiz, Behzad Bordbar, Juan Herná...
ISCA
2005
IEEE
79views Hardware» more  ISCA 2005»
14 years 1 months ago
Design and Evaluation of Hybrid Fault-Detection Systems
As chip densities and clock rates increase, processors are becoming more susceptible to transient faults that can affect program correctness. Up to now, system designers have prim...
George A. Reis, Jonathan Chang, Neil Vachharajani,...
SSR
2001
73views more  SSR 2001»
13 years 8 months ago
XML implementation of frame processor
A quantitative study has shown that frame technology [1] supported by Fusion toolset can lead to reduction in time-tomarket (70%) and project costs (84%). Frame technology has bee...
Tak Wong, Stan Jarzabek, Soe Myat Swe, Ru Shen, Ho...