Sciweavers

1224 search results - page 183 / 245
» A Framework for Structured Distributed Object Computing
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 8 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
NSPW
2006
ACM
14 years 2 months ago
Sanitization models and their limitations
This work explores issues of computational disclosure control. We examine assumptions in the foundations of traditional problem statements and abstract models. We offer a comprehe...
Rick Crawford, Matt Bishop, Bhume Bhumiratana, Lis...
SMA
2008
ACM
155views Solid Modeling» more  SMA 2008»
13 years 8 months ago
Filament tracking and encoding for complex biological networks
We present a framework for segmenting and storing filament networks from scalar volume data. Filament structures are commonly found in data generated using high-throughput microsc...
David Mayerich, John Keyser
NETGAMES
2004
ACM
14 years 1 months ago
OpenPING: a reflective middleware for the construction of adaptive networked game applications
The emergence of distributed Virtual Reality (VR) applications that run over the Internet has presented networked game application designers with new challenges. In an environment...
Paul Okanda, Gordon S. Blair