6365 search results - page 20 / 1273 » Fast Local Computation Algorithms |
132
click to vote
KDD
2009
ACM
16 years 29 days ago
2009
ACM
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...
120
click to vote
AROBOTS
2002
15 years 8 days ago
2002
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 ...
109
Voted
RTSS
2005
IEEE
15 years 6 months ago
2005
IEEE
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...
101
click to vote
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
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...
88
Voted
CORR
2006
Springer
15 years 13 days ago
2006
Springer
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...