Sciweavers

794 search results - page 35 / 159
» Challenges in Parallel Graph Processing
Sort
View
LSSC
2007
Springer
14 years 3 months ago
An Ant-Based Model for Multiple Sequence Alignment
Abstract. Multiple sequence alignment is a key process in today’s biology, and finding a relevant alignment of several sequences is much more challenging than just optimizing so...
Frédéric Guinand, Yoann Pigné
ICASSP
2010
IEEE
13 years 7 months ago
Random attributed graphs for statistical inference from content and context
Coping with Information Overload is a major challenge of the 21st century. Huge volumes and varieties of multilingual data must be processed to extract salient information. Previo...
Allen L. Gorin, Carey E. Priebe, John Grothendieck
ICCV
2009
IEEE
1136views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Robust Graph-Cut Scene Segmentation and Reconstruction for Free-Viewpoint Video of Complex Dynamic Scenes
Current state-of-the-art image-based scene reconstruction techniques are capable of generating high-fidelity 3D models when used under controlled capture conditions. However, th...
Jean-Yves Guillemaut, Joe Kilner and Adrian Hilton
ECEASST
2006
305views more  ECEASST 2006»
13 years 9 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
CONCUR
2009
Springer
14 years 3 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...