Sciweavers

680 search results - page 118 / 136
» Optimal spot-checking to minimize the computation time in vo...
Sort
View
CRV
2008
IEEE
205views Robotics» more  CRV 2008»
15 years 6 months ago
Accurate Boundary Localization using Dynamic Programming on Snakes
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
INFOCOM
2006
IEEE
15 years 5 months ago
Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...
Hai Liu, Peng-Jun Wan, Xiaohua Jia, Xinxin Liu, F....
SENSYS
2003
ACM
15 years 5 months ago
Differentiated surveillance for sensor networks
For many sensor network applications such as military surveillance, it is necessary to provide full sensing coverage to a security-sensitive area while at the same time minimizing...
Ting Yan, Tian He, John A. Stankovic
SARA
2009
Springer
15 years 4 months ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 28 days ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...