Sciweavers

2157 search results - page 354 / 432
» Binary ant algorithm
Sort
View
CVIU
2004
134views more  CVIU 2004»
14 years 11 months ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera
PODC
2009
ACM
15 years 6 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
AADEBUG
2005
Springer
15 years 5 months ago
Experimental evaluation of using dynamic slices for fault location
Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic sl...
Xiangyu Zhang, Haifeng He, Neelam Gupta, Rajiv Gup...
TIFS
2010
173views more  TIFS 2010»
14 years 10 months ago
A hybrid approach for generating secure and discriminating face template
Abstract—Biometric template protection is one of the most important issues in deploying a practical biometric system. To tackle this problem, many algorithms, that do not store t...
Yi C. Feng, Pong C. Yuen, Anil K. Jain
CORR
2010
Springer
175views Education» more  CORR 2010»
14 years 8 months ago
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
Thanasis Balafoutis, Anastasia Paparrizou, Kostas ...