Sciweavers

77 search results - page 15 / 16
» cai 2005
Sort
View
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
14 years 28 days ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
PADS
2005
ACM
14 years 26 days ago
Routing Worm: A Fast, Selective Attack Worm Based on IP Address Information
Most well-known Internet worms, such as Code Red, Slammer, and Blaster, infected vulnerable computers by scanning the entire Internet IPv4 space. In this paper, we present a new s...
Cliff Changchun Zou, Donald F. Towsley, Weibo Gong...
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 25 days ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
ICCS
2005
Springer
14 years 24 days ago
Java-Based Grid Service Spread and Implementation in Remote Sensing Applications
Remote sensing applications often concern very large volumes of spatio-temporal data, the emerging Grid computing technologies bring an effective solution to this problem. The Open...
Yanguang Wang, Yong Xue, Jianqin Wang, Chaolin Wu,...
DAC
2005
ACM
13 years 9 months ago
Partitioning-based approach to fast on-chip decap budgeting and minimization
This paper proposes a fast decoupling capacitance (decap) allocation and budgeting algorithm for both early stage decap estimation and later stage decap minimization in today’s ...
Hang Li, Zhenyu Qi, Sheldon X.-D. Tan, Lifeng Wu, ...