Sciweavers

651 search results - page 115 / 131
» Index Sets and Universal Numberings
Sort
View
CSFW
2010
IEEE
13 years 11 months ago
Automating Open Bisimulation Checking for the Spi Calculus
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
Alwen Tiu, Jeremy E. Dawson
AUTOMATICA
2007
142views more  AUTOMATICA 2007»
13 years 8 months ago
Lyapunov-based switching control of nonlinear systems using high-gain observers
Abstract— We consider dynamic output feedback practical stabilization of uniformly observable nonlinear systems, based on high-gain observers with saturation. We assume that unce...
Leonid B. Freidovich, Hassan K. Khalil
BMCBI
2010
153views more  BMCBI 2010»
13 years 8 months ago
Challenges in microarray class discovery: a comprehensive examination of normalization, gene selection and clustering
Background: Cluster analysis, and in particular hierarchical clustering, is widely used to extract information from gene expression data. The aim is to discover new classes, or su...
Eva Freyhult, Mattias Landfors, Jenny Önskog,...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 8 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 8 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