Sciweavers

5606 search results - page 483 / 1122
» Randomization Techniques for Graphs.
Sort
View
IEEECIT
2010
IEEE
15 years 5 months ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...
CHI
2006
ACM
16 years 7 months ago
Feeling what you hear: tactile feedback for navigation of audio graphs
Access to digitally stored numerical data is currently very limited for sight impaired people. Graphs and visualizations are often used to analyze relationships between numerical ...
Steven A. Wall, Stephen A. Brewster
ICASSP
2008
IEEE
16 years 1 months ago
Joint base-calling of two DNA sequences with factor graphs
—Automated estimation of DNA base-sequences is an important step in genomics and in many other emerging fields in biological and medical sciences. Current automated sequencers p...
Xiaomeng Shi, Desmond S. Lun, Jim Meldrim, Ralf K&...
SCIA
2007
Springer
119views Image Analysis» more  SCIA 2007»
16 years 28 days ago
Watertight Multi-view Reconstruction Based on Volumetric Graph-Cuts
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
Mario Sormann, Christopher Zach, Joachim Bauer, Ko...
WEA
2007
Springer
112views Algorithms» more  WEA 2007»
16 years 28 days ago
Crossing Minimization in Weighted Bipartite Graphs
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Olca A. Çakiroglu, Cesim Erten, Ömer K...