3466 search results - page 215 / 694 » Fast computation of special resultants |
140
click to vote
ACMSE
2006
ACM
16 years 20 days ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
167
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
151
click to vote
MSE
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we present fast algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Nobel Successive Elimination Algorithms fo...
167
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
183
click to vote
ACII
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. An eye contour extraction method which combines a simplied version of Active Shape Model(ASM) with a gradient method is proposed. Considering the large amount of calculat...