3454 search results - page 214 / 691 » Modern computer algebra |
149
click to vote
ECCV
2006
Springer
15 years 10 months ago
2006
Springer
We study the rank and geometry of the multibody fundamental matrix, a geometric entity characterizing the two-view geometry of dynamic scenes consisting of multiple rigidbody moti...
166
click to vote
ERSHOV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Two formal models for description of timing attacks are presented, studied and compared with other security concepts. The models are based on a timed process algebra and ...
184
click to vote
PARLE
1987
15 years 10 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
156
click to vote
UAI
2004
15 years 8 months ago
2004
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-...
132
click to vote
SODA
1990
ACM
15 years 7 months ago
1990
ACM
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...