Sciweavers

2425 search results - page 274 / 485
» Practical performance models for complex, popular applicatio...
Sort
View
FUIN
2002
108views more  FUIN 2002»
15 years 6 months ago
Approximate Entropy Reducts
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
Dominik Slezak
MSWIM
2004
ACM
16 years 2 days ago
Mobile dynamic content distribution networks
Mobile networks are becoming increasingly popular as a means for distributing information to a large number of users. In comparison to wired networks, mobile networks are distingu...
Wagner Moro Aioffi, Geraldo Robson Mateus, Jussara...
APBC
2008
231views Bioinformatics» more  APBC 2008»
15 years 8 months ago
Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Si...
DSD
2009
IEEE
144views Hardware» more  DSD 2009»
16 years 1 months ago
Composable Resource Sharing Based on Latency-Rate Servers
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
Benny Akesson, Andreas Hansson, Kees Goossens
BMEI
2008
IEEE
16 years 1 months ago
A New Approach for Tree Alignment Based on Local Re-Optimization
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
Feng Yue, Jijun Tang