3454 search results - page 612 / 691 » Modern computer algebra |
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
AVSS
2005
IEEE
14 years 2 months ago
2005
IEEE
We introduce a method for recovering the spatial and temporal alignment between two or more views of objects moving over a ground plane. Existing approaches either assume that the...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
WMPI
2004
ACM
14 years 2 months ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...