1390 search results - page 74 / 278 » On the Algebraic Structure of Convergence |
190
click to vote
ATVA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
190
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
158
click to vote
GD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
162
click to vote
MFCS
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
148
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
We study the multi-frame structure from motion problem when the camera translates on a plane with small baselines and arbitrary rotations. This case shows up in many practical appl...