Sciweavers

431 search results - page 25 / 87
» Implementing the maximum of monotone algorithms
Sort
View
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 4 months ago
A destructive evolutionary process: a pilot implementation
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
Joe Sullivan, Conor Ryan
CAV
2005
Springer
104views Hardware» more  CAV 2005»
15 years 3 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...
MEMICS
2010
14 years 4 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
ISBI
2002
IEEE
15 years 10 months ago
Automatic segmentation of mammographic masses using fuzzy shadow and maximum-likelihood analysis
This study attempted to accurately segment tumors in mammograms. Although this task is considered to be a preprocessing step in a computer analysis program, it plays an important ...
Lisa Kinnard, Shih-Chung Ben Lo, Paul C. Wang, Mat...