Sciweavers

2814 search results - page 17 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ISM
2006
IEEE
277views Multimedia» more  ISM 2006»
13 years 8 months ago
Efficient Bottom-Up Image Segmentation Using Region Competition and the Mumford-Shah Model for Color and Textured Images
Curve evolution implementations [3][23] [25] of the Mumford-Shah functional [16] are of broad interest in image segmentation. These implementations, however, have initialization p...
Yongsheng Pan, J. Douglas Birdwell, Seddik M. Djou...
CONPAR
1992
14 years 20 days ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
ICPR
2008
IEEE
14 years 3 months ago
FCM-based orientation selection for competitive coding-based palmprint recognition
Coding based methods are among the most promising palmprint recognition methods. As one representative coding method, the competitive code first convolves the palmprint image with...
Feng Yue, Wangmeng Zuo, Kuanquan Wang, David Zhang
EUROSYS
2007
ACM
14 years 5 months ago
Competitive prefetching for concurrent sequential I/O
During concurrent I/O workloads, sequential access to one I/O stream can be interrupted by accesses to other streams in the system. Frequent switching between multiple sequential ...
Chuanpeng Li, Kai Shen, Athanasios E. Papathanasio...
ICML
1995
IEEE
14 years 9 months ago
Learning to Make Rent-to-Buy Decisions with Systems Applications
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...
P. Krishnan, Philip M. Long, Jeffrey Scott Vitter