Sciweavers

1170 search results - page 25 / 234
» How Fast Is Too Fast
Sort
View
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 3 months ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001
ICDCN
2009
Springer
15 years 7 months ago
An Analytical Model of Information Dissemination for a Gossip-Based Protocol
We develop an analytical model of information dissemination for a gossip protocol. With this model we analyse how fast an item is replicated through a network. We also determine th...
Rena Bakhshi, Daniela Gavidia, Wan Fokkink, Maarte...
91
Voted
FAST
2010
15 years 3 months ago
Understanding Latent Sector Errors and How to Protect Against Them
Latent sector errors (LSEs) refer to the situation where particular sectors on a drive become inaccessible. LSEs are a critical factor in data reliability, since a single LSE can ...
Bianca Schroeder, Sotirios Damouras, Phillipa Gill
81
Voted
ECCV
2006
Springer
16 years 2 months ago
Fast, Quality, Segmentation of Large Volumes - Isoperimetric Distance Trees
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...
Leo Grady
378
Voted

Publication
1147views
16 years 11 months ago
PDE-based fast local level set method
We develop a fast method to localize the level set method of Osher and Sethian (1988, Journal of Computational Physics) and address two important issues that are intrinsic to the l...
Danping Peng, Barry Merriman, Stanley Osher, Hongk...