Sciweavers

1170 search results - page 16 / 234
» How Fast Is Too Fast
Sort
View
126
Voted
MICCAI
2010
Springer
14 years 10 months ago
Fast Random Walker with Priors Using Precomputation for Interactive Medical Image Segmentation
Abstract. Updating segmentation results in real-time based on repeated user input is a reliable way to guarantee accuracy, paramount in medical imaging applications, while making e...
Shawn Andrews, Ghassan Hamarneh, Ahmed Saad
ICIAR
2010
Springer
14 years 10 months ago
Image Segmentation for Robots: Fast Self-adapting Gaussian Mixture Model
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...
Nicola Greggio, Alexandre Bernardino, José ...
ICDCS
2002
IEEE
15 years 5 months ago
Fast Collect in the absence of contention
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
Burkhard Englert, Eli Gafni
SIGOPSE
1990
ACM
15 years 4 months ago
Availability in the Sprite distributed file system
In the Sprite environment, tolerating faults means recovering from them quickly. Our position is that performance and availability are the desired features of the typical locally-...
Mary Baker, John K. Ousterhout
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 7 months ago
A New ILP-Based p-Cycle Construction Algorithm without Candidate Cycle Enumeration
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...
Bin Wu, Kwan Lawrence Yeung, King-Shan Lui, Shizho...