2127 search results - page 150 / 426 » Computing large matchings fast |
183
click to vote
NIPS
2008
15 years 5 months ago
2008
The Singular Value Decomposition is a key operation in many machine learning methods. Its computational cost, however, makes it unscalable and impractical for applications involvi...
117
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this note we reinvestigate the task of computing creative telescoping relations in differential-difference operator algebras. Our approach is based on an ansatz that e...
110
click to vote
ISCAS
2006
IEEE
15 years 10 months ago
2006
IEEE
— We propose a fast Modular Arithmetic Logic Unit (MALU) that is scalable in the digit size (d) and the field size (k). The datapath of MALU has chains of Carry Save Adders (CSA...
158
click to vote
AROBOTS
2002
15 years 4 months 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 ...
132
Voted
SSPR
2010
Springer
15 years 2 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...