Sciweavers

3946 search results - page 568 / 790
» The computational complexity of choice sets
Sort
View
BMCBI
2007
142views more  BMCBI 2007»
15 years 6 months ago
SABERTOOTH: protein structural alignment based on a vectorial structure representation
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...
Florian Teichert, Ugo Bastolla, Markus Porto
AAAI
1990
15 years 7 months ago
The Design of a Marker Passing Architecture for Knowledge Processing
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
Wing Lee, Dan I. Moldovan
IJVR
2008
106views more  IJVR 2008»
15 years 6 months ago
Improved View Frustum Culling Technique for Real-Time Virtual Heritage Application
Real-time virtual heritage application is normally executed with a high performance computer system. This is due to the complexity and highly computational cost which makes such sy...
Mohd Shahrizal Sunar, Abdullah Mohd Zin, Tengku M....

Publication
275views
17 years 5 months ago
Line-art Illustration of Dynamic and Specular Surfaces
Line-art illustrations are effective tools for conveying shapes and shading of complex objects. We present a set of new algorithms to render line-art illustrations of dynamic and s...
Yongjin Kim, Jingyi Yu, Xuan Yu, Seungyong Lee
CVPR
2009
IEEE
17 years 1 months ago
Constrained Clustering via Spectral Regularization
We propose a novel framework for constrained spectral clustering with pairwise constraints which specify whether two objects belong to the same cluster or not. Unlike previous m...
Zhenguo Li (The Chinese University of Hong Kong), ...