Sciweavers

2157 search results - page 51 / 432
» Optimal Fast Hashing
Sort
View
161
Voted
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
15 years 10 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
INFOCOM
2006
IEEE
15 years 10 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
JSCIC
2006
98views more  JSCIC 2006»
15 years 3 months ago
Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations
In the field of strong-stability-preserving time discretizations, a number of researchers have considered using both upwind and downwind approximations for the same derivative, in...
Sigal Gottlieb, Steven J. Ruuth
MICCAI
2010
Springer
15 years 2 months ago
Fast and Automatic Heart Isolation in 3D CT Volumes: Optimal Shape Initialization
Abstract. Heart isolation (separating the heart from the proximity tissues, e.g., lung, liver, and rib cage) is a prerequisite to clearly visualize the coronary arteries in 3D. Suc...
Yefeng Zheng, Fernando Vega Higuera, Shaohua Kevin...
WDAG
2010
Springer
184views Algorithms» more  WDAG 2010»
15 years 2 months ago
Fast Asynchronous Consensus with Optimal Resilience
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
Ittai Abraham, Marcos Kawazoe Aguilera, Dahlia Mal...