Sciweavers

2168 search results - page 87 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
128
Voted
MICCAI
2009
Springer
16 years 27 days ago
Fast Automatic Segmentation of the Esophagus from 3D CT Data Using a Probabilistic Model
Automated segmentation of the esophagus in CT images is of high value to radiologists for oncological examinations of the mediastinum. It can serve as a guideline and prevent confu...
Johannes Feulner, Shaohua Kevin Zhou, Alexander Ca...
152
Voted
IEEEICCI
2005
IEEE
15 years 9 months ago
A brain-like computer for cognitive software applications: the Ersatz Brain project
We want to design a suitable computer for the efficient execution of the software now being developed that will display human-like cognitive abilities. Examples of these potential...
J. A. Anderson
119
Voted
DCC
2004
IEEE
16 years 3 months ago
An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Ja...
129
Voted
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 3 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
123
Voted
FMSD
2006
104views more  FMSD 2006»
15 years 3 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord