Sciweavers

496 search results - page 32 / 100
» A Genetic Algorithm for the Synthesis of Structured Data Pat...
Sort
View
ICALP
2010
Springer
13 years 11 months ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
Loukas Georgiadis
IJRR
2007
171views more  IJRR 2007»
13 years 7 months ago
Creating High-quality Paths for Motion Planning
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
Roland Geraerts, Mark H. Overmars
ICMCS
2006
IEEE
115views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Similar Segment Detection for Music Structure Analysis via Viterbi Algorithm
The analysis of audio signals of popular and rock songs of the versechorus form to reconstruct its original musical structures is investigated in this work. We first compute the ...
Yu Shiu, Hong Jeong, C. C. Jay Kuo
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 1 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
PLDI
2004
ACM
14 years 1 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....