Sciweavers

2064 search results - page 196 / 413
» Segmentation Problems
Sort
View
ECCV
2010
Springer
14 years 4 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
14 years 2 days ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
14 years 4 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
AAAI
2010
14 years 6 days ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
COMPGEOM
2007
ACM
14 years 2 months ago
Traversing a set of points with a minimum number of turns
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, F...