1948 search results - page 237 / 390 » Formalizing Mirror Theory |
299
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
173
click to vote
RECOMB
2008
Springer
16 years 7 months ago
2008
Springer
In the past years, many combinatorial arguments have been made to support the theory that mammalian genome rearrangement scenarios rely heavily on breakpoint reuse. Different model...
168
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
209
click to vote
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
A formal semantics of uncertain databases typically takes an algebraic approach by mapping an uncertain database to a set of relational databases, or possible worlds. We present a...
164
click to vote
QSIC
2009
IEEE
16 years 1 months ago
2009
IEEE
—A well-founded testing theory encourages the practical application of test case generation techniques. This aims at overcoming the ever increasing complexity of softwareenabled ...