Sciweavers

208 search results - page 41 / 42
» Improved upper bounds on the crossing number
Sort
View
CASES
2010
ACM
13 years 5 months ago
Low cost multicast authentication via validity voting in time-triggered embedded control networks
Wired embedded networks must include multicast authentication to prevent masquerade attacks within the network. However, unique constraints for these networks make most existing m...
Christopher Szilagyi, Philip Koopman
DLOG
2010
13 years 5 months ago
Optimizing Algebraic Tableau Reasoning for SHOQ: First Experimental Results
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
Jocelyne Faddoul, Volker Haarslev
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 7 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
BTW
2007
Springer
154views Database» more  BTW 2007»
14 years 1 months ago
Integrating Query-Feedback Based Statistics into Informix Dynamic Server
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...