2127 search results - page 49 / 426 » Computing large matchings fast |
132
Voted
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
116
click to vote
COLING
2008
15 years 5 months ago
2008
Translation model size is growing at a pace that outstrips improvements in computing power, and this hinders research on many interesting models. We show how an algorithmic scalin...
147
Voted
CGF
2004
15 years 3 months ago
2004
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...
108
Voted
MICCAI
2009
Springer
16 years 4 months ago
2009
Springer
Obtaining detailed, patient-specific blood flow information would be very useful in detecting and monitoring cardio-vascular diseases. Current approaches rely on computational flui...
145
Voted
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper proposes a computationally efficient approach for estimating camera motion based on a voting mechanism that neither relies on explicit feature matching nor RANSAC. In t...