Sciweavers

66 search results - page 8 / 14
» A comparison of algorithms for interprocedural class analysi...
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
13 years 8 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
TIP
2008
85views more  TIP 2008»
13 years 8 months ago
A Scale-Based Connected Coherence Tree Algorithm for Image Segmentation
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...
Jundi Ding, RuNing Ma, Songcan Chen
TCS
2010
13 years 6 months ago
Runtime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
Dirk Sudholt, Carsten Witt
BMCBI
2006
150views more  BMCBI 2006»
13 years 8 months ago
Protein structure similarity from principle component correlation analysis
Background: Owing to rapid expansion of protein structure databases in recent years, methods of structure comparison are becoming increasingly effective and important in revealing...
Xiaobo Zhou, James Chou, Stephen T. C. Wong
TACAS
2007
Springer
131views Algorithms» more  TACAS 2007»
14 years 2 months ago
From Time Petri Nets to Timed Automata: An Untimed Approach
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...
Davide D'Aprile, Susanna Donatelli, Arnaud Sangnie...