Sciweavers

265 search results - page 23 / 53
» Biased Normalized Cuts
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 12 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...

Publication
200views
12 years 6 months ago
Tracking Endocardial Motion via Multiple Model Filtering of Distribution Cut
Tracking heart motion plays an essential role in the diagnosis of cardiovascular diseases. As such, accurate characterization of dynamic behavior of the left ventricle (LV) is esse...
Kumaradevan Punithakumar, Ismail Ben Ayed, Ali Isl...
CCR
2004
143views more  CCR 2004»
13 years 7 months ago
The cutting EDGE of IP router configuration
Abstract-- Human error in configuring routers undermines attempts to provide reliable, predictable end-to-end performance on IP networks. Manual configuration, while expensive and ...
Donald F. Caldwell, Anna Gilbert, Joel Gottlieb, A...
ALGORITHMICA
2006
90views more  ALGORITHMICA 2006»
13 years 7 months ago
Destruction of Very Simple Trees
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); th...
James Allen Fill, Nevin Kapur, Alois Panholzer

Source Code
2231views
15 years 1 months ago
The Berkeley Segmentation Engine (BSE)
The code is a (good, in my opinion) implementation of a segmentation engine based on normalised cuts (a spectral clustering algorithm) and a pixel affinity matrix calculation algor...
Charless Fowlkes