Sciweavers

173 search results - page 9 / 35
» An optimal randomized algorithm for maximum Tukey depth
Sort
View
IPL
2000
146views more  IPL 2000»
13 years 7 months ago
Better approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Refael Hassin, Shlomi Rubinstein
ISBI
2004
IEEE
14 years 8 months ago
Vascular Segmentation in Three-Dimensional Rotational Angiography Based on Maximum Intensity Projections
Three-dimensional rotational angiography (3D-RA) is a relatively new and promising technique for imaging blood vessels. In this paper, we propose a novel 3D-RA vascular segmentati...
Rui Gan, Albert C. S. Chung, Wilbur C. K. Wong, Si...
STACS
1999
Springer
13 years 11 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
14 years 8 months ago
Constrained optimization for validation-guided conditional random field learning
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...
Minmin Chen, Yixin Chen, Michael R. Brent, Aaron E...
ICIP
1998
IEEE
14 years 9 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson