Sciweavers

CAV
2010
Springer
198views Hardware» more  CAV 2010»
14 years 1 months ago
Termination Analysis with Compositional Transition Invariants
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
Daniel Kroening, Natasha Sharygina, Aliaksei Tsito...
CSE
2009
IEEE
14 years 1 months ago
Efficient Broadcast on Area of Interest in Voronoi Overlays
This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-topeer ne...
Michele Albano, Ranieri Baraglia, Matteo Mordacchi...
CPM
2009
Springer
207views Combinatorics» more  CPM 2009»
14 years 1 months ago
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
Simone Faro, Thierry Lecroq
CVPR
2007
IEEE
14 years 1 months ago
Local Shape Registration Using Boundary-Constrained Match of Skeletons
This paper presents a new shape registration algorithm that establishes "meaningful correspondence" between objects, in that it preserves the local shape correspondence ...
Yun Zhu, Xenophon Papademetris, Albert J. Sinusas,...
PQCRYPTO
2010
187views Cryptology» more  PQCRYPTO 2010»
14 years 1 months ago
Information-Set Decoding for Linear Codes over Fq
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
Christiane Peters
ARITH
2007
IEEE
14 years 1 months ago
An Algorithm for Inversion in GF(2^m) Suitable for Implementation Using a Polynomial Multiply Instruction on GF(2)
An algorithm for inversion in GF(2m ) suitable for implementation using a polynomial multiply instruction on GF(2) is proposed. It is based on the extended Euclid's algorithm...
Katsuki Kobayashi, Naofumi Takagi, Kazuyoshi Takag...
CIBCB
2007
IEEE
14 years 1 months ago
Associative Artificial Neural Network for Discovery of Highly Correlated Gene Groups Based on Gene Ontology and Gene Expression
Abstract-- The advance of high-throughput experimental technologies poses continuous challenges to computational data analysis in functional and comparative genomics studies. Gene ...
Ji He, Xinbin Dai, Xuechun Zhao
CAEPIA
2007
Springer
14 years 1 months ago
Efficient Pruning of Operators in Planning Domains
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
Anders Jonsson
BIBM
2007
IEEE
149views Bioinformatics» more  BIBM 2007»
14 years 1 months ago
An Algorithm for Assigning Unique Keys to Metabolic Pathways
Different databases of metabolic pathways assign pathways different keys. For this reason, it is difficult to automatically compare pathways across databases. We introduce an algo...
Fang Fang, Robert L. Grossman, Xiangjun Liu
BIBM
2009
IEEE
118views Bioinformatics» more  BIBM 2009»
14 years 1 months ago
Inexact Local Alignment Search over Suffix Arrays
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
Mohammadreza Ghodsi, Mihai Pop