Sciweavers

2745 search results - page 129 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
151
Voted
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 29 days ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
134
Voted
ICIP
2003
IEEE
16 years 5 months ago
Fast indexing for image retrieval based on local appearance with re-ranking
This paper describes an approach to retrieve images containing specific objects, scenes or buildings. The image content is captured by a set of local features. More precisely, we ...
Hao Shao, Tomás Svoboda, Vittorio Ferrari, ...
121
Voted
ICDIM
2007
IEEE
15 years 10 months ago
Fast encounter-based synchronization for mobile devices
The large and growing number of computing devices used by individuals has caused the challenges of distributed storage to take on increased importance. In addition to desktops and...
Daniel Peek, Douglas B. Terry, Venugopalan Ramasub...
133
Voted
RAS
2007
102views more  RAS 2007»
15 years 3 months ago
Fast and accurate SLAM with Rao-Blackwellized particle filters
Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter in which each ...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
CVPR
2009
IEEE
16 years 11 months ago
From Structure-from-Motion Point Clouds to Fast Location Recognition
Efficient view registration with respect to a given 3D reconstruction has many applications like inside-out tracking in indoor and outdoor environments, and geo-locating images ...
Arnold Irschara (Graz University of Technology), C...