Sciweavers

6365 search results - page 20 / 1273
» Fast Local Computation Algorithms
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
15 years 10 months ago
Fast 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-s...
Donghui Yan, Ling Huang, Michael I. Jordan
AROBOTS
2002
91views more  AROBOTS 2002»
14 years 9 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
RTSS
2005
IEEE
15 years 3 months ago
Fast On-the-Fly Parametric Real-Time Model Checking
This paper presents a local algorithm for solving the universal parametric real-time model-checking problem. The problem may be phrased as follows: given a real-time system and te...
Dezhuang Zhang, Rance Cleaveland
ICIP
2003
IEEE
15 years 11 months ago
Fast Feldkamp algorithm for cone-beam computer tomography
We propose a new fast Feldkamp algorithm for 3-D cone beam tomography with a circular source trajectory. The algorithm is an extension of our recent fast native 2-D fan-beam recon...
Shu Xiao, Yoram Bresler, David C. Munson Jr.
73
Voted
CORR
2006
Springer
114views Education» more  CORR 2006»
14 years 9 months ago
Fast algorithms for computing isogenies between elliptic curves
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
Alin Bostan, Bruno Salvy, François Morain, ...