10997 search results - page 199 / 2200 » On the Structure of Complete Sets |
224
click to vote
FROCOS
2009
Springer
16 years 1 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
152
click to vote
CSR
2007
Springer
16 years 24 days ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
170
click to vote
ISLPED
2003
ACM
15 years 12 months ago
2003
ACM
A new architectural technique to reduce power dissipation in data caches is proposed. In multimedia applications, a major portion of data cache accesses hit in the same cache set ...
178
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
—The problem we address in the paper is how to learn a joint representation from data lying on multiple manifolds. We are given multiple data sets and there is an underlying comm...
153
click to vote
CCCG
1993
15 years 8 months ago
1993
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...