Sciweavers

2745 search results - page 126 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
CVPR
2008
IEEE
16 years 5 months ago
Fast and robust numerical solutions to minimal problems for cameras with radial distortion
A number of minimal problems of structure from motion for cameras with radial distortion have recently been studied and solved in some cases. These problems are known to be numeri...
Karl Åström, Klas Josephson, Martin Byr...
126
Voted
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
15 years 9 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
143
Voted
GD
1998
Springer
15 years 8 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
145
Voted
FSS
2010
147views more  FSS 2010»
15 years 2 months ago
A divide and conquer method for learning large Fuzzy Cognitive Maps
Fuzzy Cognitive Maps (FCMs) are a convenient tool for modeling and simulating dynamic systems. FCMs were applied in a large number of diverse areas and have already gained momentu...
Wojciech Stach, Lukasz A. Kurgan, Witold Pedrycz
135
Voted
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 10 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh