Sciweavers

4212 search results - page 58 / 843
» On Compressible Pairings and Their Computation
Sort
View
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
15 years 4 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara
109
Voted
IJISEC
2007
61views more  IJISEC 2007»
15 years 14 days ago
Identity-based key agreement protocols from pairings
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this ty...
Liqun Chen, Zhaohui Cheng, Nigel P. Smart
103
Voted
DCC
2010
IEEE
15 years 7 months ago
gFPC: A Self-Tuning Compression Algorithm
This paper presents and evaluates gFPC, a self-tuning implementation of the FPC compression algorithm for double-precision floating-point data. gFPC uses a genetic algorithm to re...
Martin Burtscher, Paruj Ratanaworabhan
113
Voted
ISVC
2005
Springer
15 years 6 months ago
Toward Real Time Fractal Image Compression Using Graphics Hardware
Abstract. In this paper, we present a parallel fractal image compression using the programmable graphics hardware. The main problem of fractal compression is the very high computin...
Ugo Erra
97
Voted
NAACL
2010
14 years 10 months ago
An extractive supervised two-stage method for sentence compression
We present a new method that compresses sentences by removing words. In a first stage, it generates candidate compressions by removing branches from the source sentence's dep...
Dimitrios Galanis, Ion Androutsopoulos