199 search results - page 25 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
CIE
2006
Springer
14 years 9 days ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
COMPGEOM
2011
ACM
13 years 4 days ago
2011
ACM
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
IPSN
2005
Springer
14 years 2 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...