724 search results - page 59 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...
EMMCVPR
2001
Springer
15 years 4 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
110
click to vote
RTSS
2000
IEEE
15 years 3 months ago
2000
IEEE
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
109
click to vote
ALT
2000
Springer
15 years 3 months ago
2000
Springer
In this paper1 we propose a new algorithm for providing confidence and credibility values for predictions on a multi-class pattern recognition problem which uses Support Vector mac...
113
click to vote
IEEESCC
2005
IEEE
15 years 5 months ago
2005
IEEE
The emerging paradigms of service oriented architectures and utility-based computing have the potential to greatly reduce the cost of data management. Data management service prov...