Sciweavers

884 search results - page 128 / 177
» A Proof Theory for DL-Lite
Sort
View
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 12 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
IANDC
2006
103views more  IANDC 2006»
14 years 11 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
JSC
2008
58views more  JSC 2008»
14 years 11 months ago
A Groebner basis approach to solve a Conjecture of Nowicki
Let k be a field of characteristic zero, n any positive integer and let n be the derivation n i=1 Xi Yi of the polynomial ring k[X1, . . . , Xn, Y1, . . . , Yn] in 2n variables o...
Joseph Khoury
79
Voted
FUIN
2007
110views more  FUIN 2007»
14 years 11 months ago
Controllable Delay-Insensitive Processes
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
Mark B. Josephs, Hemangee K. Kapoor
CORR
2010
Springer
131views Education» more  CORR 2010»
14 years 10 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger