Sciweavers

10608 search results - page 55 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
BIRTHDAY
2003
Springer
14 years 3 months ago
On the Computational Complexity of Hierarchical Radiosity
The hierarchical radiosity algorithm is an efficient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization ...
Robert Garmann, Heinrich Müller
WAIM
2010
Springer
13 years 7 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
BMCBI
2007
109views more  BMCBI 2007»
13 years 10 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
ICDM
2007
IEEE
105views Data Mining» more  ICDM 2007»
14 years 4 months ago
Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT
Most algorithms for mining interesting spatial colocations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on th...
Florian Verhein, Ghazi Al-Naymat
IFIP
2004
Springer
14 years 3 months ago
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
Chung-Chih Li