Sciweavers

2127 search results - page 52 / 426
» Computing large matchings fast
Sort
View
123
Voted
IV
2003
IEEE
81views Visualization» more  IV 2003»
15 years 8 months ago
Semantically Modified Diffusion Limited Aggregation for Visualizing Large-Scale Networks
Diffusion-Limited Aggregation (DLA) is a model of fractal growth. Computer models can simulate the fast aggregation of millions of particles. In this paper, we propose a modified ...
Chaomei Chen, Natasha Lobo
CVPR
2010
IEEE
15 years 7 months ago
Model Globally, Match Locally: Efficient and Robust 3D Object Recognition
This paper addresses the problem of recognizing freeform 3D objects in point clouds. Compared to traditional approaches based on point descriptors, which depend on local informati...
Bertram Drost, Markus Ulrich, Nassir Navab, Slobod...
132
Voted
PARA
2004
Springer
15 years 8 months ago
Rational Krylov for Large Nonlinear Eigenproblems
Rational Krylov is an extension of the Lanczos or Arnoldi eigenvalue algorithm where several shifts (matrix factorizations) are used in one run. It corresponds to multipoint moment...
Axel Ruhe
117
Voted
ECCV
2010
Springer
15 years 8 months ago
Fast Covariance Computation and Dimensionality Reduction for Sub-Window Features in Images
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...
142
Voted
CSR
2006
Springer
15 years 7 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan