Sciweavers

2064 search results - page 87 / 413
» Segmentation Problems
Sort
View
JMLR
2010
100views more  JMLR 2010»
13 years 3 months ago
Discriminative Topic Segmentation of Text and Speech
We explore automated discovery of topicallycoherent segments in speech or text sequences. We give two new discriminative topic segmentation algorithms which employ a new measure o...
Mehryar Mohri, Pedro Moreno, Eugene Weinstein
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 10 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
MICCAI
2009
Springer
13 years 11 months ago
Optimal Graph Search Segmentation Using Arc-weighted Graph for Simultaneous Surface Detection of Bladder and Prostate
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
Qi Song, Xiaodong Wu, Yunlong Liu, Mark Smith, Joh...
CVPR
2010
IEEE
14 years 5 months ago
The Cluttered Background Problem for Active Contours: A Minimum-Latency Solution
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Stefano Soatto, Ganesh Sundaramoorthi, Anthony Yez...
STACS
2001
Springer
14 years 1 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid