Sciweavers

514 search results - page 82 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
MICCAI
2004
Springer
14 years 8 months ago
Enhancing Fourier Volume Rendering Using Contour Extraction
Fourier Volume Rendering (FVR) has received considerable attention in volume visualization during the last decade due its O(N2 logN) rendering time complexity, where O(N3 ) is the ...
Zoltán Nagy, Marcin Novotni, Reinhard Klein
WWW
2006
ACM
14 years 8 months ago
Analysis of communication models in web service compositions
In this paper we describe an approach for the verification of Web service compositions defined by sets of BPEL processes. The key aspect of such a verification is the model adopte...
Raman Kazhamiakin, Marco Pistore, Luca Santuari
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
CHI
2005
ACM
14 years 8 months ago
Applying the lessons of the attack on the world trade center, 11th September 2001, to the design and use of interactive evacuati
The collapse of buildings, such as terminal 2E at Paris' Charles de Gaule Airport, and of fires, such as the Rhode Island, Station Night Club tragedy, has focused public atte...
C. W. Johnson
SOSP
2007
ACM
14 years 4 months ago
Improving file system reliability with I/O shepherding
We introduce a new reliability infrastructure for file systems called I/O shepherding. I/O shepherding allows a file system developer to craft nuanced reliability policies to de...
Haryadi S. Gunawi, Vijayan Prabhakaran, Swetha Kri...