Sciweavers

2489 search results - page 160 / 498
» On the Subgroup Distance Problem
Sort
View
TIP
2002
146views more  TIP 2002»
15 years 3 months ago
Tracking nonparameterized object contours in video
We propose a new method for contour tracking in video. The inverted distance transform of the edge map is used as an edge indicator function for contour detection. Using the concep...
Hieu Tat Nguyen, Marcel Worring, Rein van den Boom...
TNN
2010
216views Management» more  TNN 2010»
14 years 11 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 4 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
AI
2009
Springer
15 years 11 months ago
STFLS: A Heuristic Method for Static and Transportation Facility Location Allocation in Large Spatial Datasets
Abstract. This paper solves a static and transportation facility location allocation problem defined as follows: given a set of locations Loc and a set of demand objects D located ...
Wei Gu, Xin Wang, Liqiang Geng
WABI
2010
Springer
143views Bioinformatics» more  WABI 2010»
15 years 2 months ago
Swiftly Computing Center Strings
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
Franziska Hufsky, Léon Kuchenbecker, Kathar...