Sciweavers

5329 search results - page 162 / 1066
» The Weighted Majority Algorithm
Sort
View
DAM
2000
199views more  DAM 2000»
15 years 2 months ago
Approximation algorithms for the shortest total path length spanning tree problem
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
117
Voted
ICCV
2007
IEEE
16 years 4 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
148
Voted
PODS
2008
ACM
109views Database» more  PODS 2008»
16 years 2 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
RTSS
1999
IEEE
15 years 6 months ago
Parallel Switching in Connection-Oriented Networks
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarant...
James H. Anderson, Sanjoy K. Baruah, Kevin Jeffay
130
Voted
ICIP
1998
IEEE
16 years 4 months ago
A Deformable Model for Human Organ Extraction
We present a modi cation of the well-known snakes algorithm for extracting contours in noisy images. Our modi cation addresses the issues of selection of the control points on an ...
Jean Gao, Akio Kosaka, Avinash C. Kak