Hans+von+Bartels

 More results for "Hans+von+B..." in  VIDEOS DOCUMENTS AUDIOS GROUPS STAGES/PROFILES ALL

• 

• Presentation slide - Hardware-Accelerated Visual Hull Reconstruction a...
• Introduction Introduction Previous Work Previous Work Hardware Hardware- -Accelerated VH Reconstruction Accelerated VH Reconstruction Hardware Hardware- -Accelerated VH Rendering Accelerated VH Render...
• Rating:        Views: (1002)     Pages: ()     Uploaded: 15-05-09
•  

• 

• Presentation slide - Hardware-Accelerated Visual Hull Reconstruction a...
• Introduction Introduction Previous Work Previous Work Hardware Hardware- -Accelerated VH Reconstruction Accelerated VH Reconstruction Hardware Hardware- -Accelerated VH Rendering Accelerated VH Render...
• Rating:        Views: (1006)     Pages: ()     Uploaded: 13-05-09
•  

• 

• On Linear Time Minor Tests And Depth First Search 1989
• Recent results on graph minors make it desirable to have efficient algorithms, that for a fixed set of graphs {H,...,He}, test whether a given graph G contains at least one graph Hi as a minor. In thi...
• Rating:        Views: (1008)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Hans Reiter and the oculo-urethro-synovial syndrome. 3. The unknown H...
• Rating:        Views: (1)     Pages: ()     Uploaded: 2004-6-30
•  

• 

• On Linear Time Minor Tests And Depth First Search 1989
• Recent results on graph minors make it desirable to have efficient algorithms, that for a fixed set of graphs {H,...,He}, test whether a given graph G contains at least one graph Hi as a minor. In thi...
• Rating:        Views: (1010)     Pages: ()     Uploaded: 15-05-09
•  

• 

• This document in subdirectoryRS/04/23/ Recursion vs Replication in Sim...
• Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Re...
• Rating:        Views: (1010)     Pages: ()     Uploaded: 13-05-09
•  

• 

• The MAXIMUM CUT and MINIMUM CUT INTO BOUNDED SETS problems on Cographs...
• In this note we give simple O(n 2) algorithms for the unweighted MAX CUT problem and the unweighted MINIMUM CUT INTO BOUND- .D S.TS problem on cographs. The algorithms can easily be modified such that...
• Rating:        Views: (1014)     Pages: ()     Uploaded: 15-05-09
•  

• 

• The MAXIMUM CUT and MINIMUM CUT INTO BOUNDED SETS problems on Cographs...
• In this note we give simple O(n 2) algorithms for the unweighted MAX CUT problem and the unweighted MINIMUM CUT INTO BOUND- .D S.TS problem on cographs. The algorithms can easily be modified such that...
• Rating:        Views: (1006)     Pages: ()     Uploaded: 13-05-09
•