1730 search results - page 141 / 346 » Algebra and Computation |
159
click to vote
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
116
Voted
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
118
click to vote
PPAM
2001
Springer
15 years 5 months ago
2001
Springer
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solutio...
106
click to vote
ADG
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
105
Voted
DGCI
2005
Springer
15 years 6 months ago
2005
Springer
Topological invariants are extremely useful in many applications related to digital imaging and geometric modeling, and homology is a classical one, which has not yet been fully e...