Sciweavers

794 search results - page 100 / 159
» Challenges in Parallel Graph Processing
Sort
View
3DIM
2011
IEEE
12 years 9 months ago
Stereo Reconstruction of Building Interiors with a Vertical Structure Prior
—Image-based computation of a 3D map for an indoor environment is a very challenging task, but also a useful step for vision-based navigation and path planning for autonomous sys...
Bernhard Zeisl, Christopher Zach, Marc Pollefeys
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
14 years 3 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
CGF
2008
151views more  CGF 2008»
13 years 8 months ago
Navigation and Exploration of Interconnected Pathways
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
Marc Streit, Michael Kalkusch, Karl Kashofer, Diet...
LCTRTS
2005
Springer
14 years 2 months ago
Generation of permutations for SIMD processors
Short vector (SIMD) instructions are useful in signal processing, multimedia, and scientific applications. They offer higher performance, lower energy consumption, and better res...
Alexei Kudriavtsev, Peter M. Kogge
CC
2003
Springer
14 years 2 months ago
Early Control of Register Pressure for Software Pipelined Loops
Abstract. The register allocation in loops is generally performed after or during the software pipelining process. This is because doing a conventional register allocation at firs...
Sid Ahmed Ali Touati, Christine Eisenbeis