Sciweavers

220 search results - page 22 / 44
» Distributed Minimum Cut Approximation
Sort
View
PPL
2000
110views more  PPL 2000»
13 years 9 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
CVPR
2008
IEEE
14 years 4 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...
CN
2006
75views more  CN 2006»
13 years 10 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
EMMCVPR
1999
Springer
14 years 2 months ago
A New Algorithm for Energy Minimization with Discontinuities
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
Yuri Boykov, Olga Veksler, Ramin Zabih
GLOBECOM
2009
IEEE
13 years 7 months ago
Efficient Data Collection for Wireless Networks: Delay and Energy Tradeoffs
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
Chao Ren, XuFei Mao, Xiang-Yang Li, Ping Xu, Guoju...