Sciweavers

4110 search results - page 72 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
HM
2007
Springer
155views Optimization» more  HM 2007»
15 years 7 months ago
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
Alexandre R. Duarte, Celso C. Ribeiro, Sebasti&aac...
117
Voted
CVPR
2008
IEEE
15 years 5 months ago
A rank constrained continuous formulation of multi-frame multi-target tracking problem
This paper presents a multi-frame data association algorithm for tracking multiple targets in video sequences. Multi-frame data association involves finding the most probable corr...
Khurram Shafique, Mun Wai Lee, Niels Haering
PAMI
2010
112views more  PAMI 2010»
15 years 2 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
COR
2006
113views more  COR 2006»
15 years 4 months ago
Capacitated facility location problem with general setup cost
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
Ling-Yun Wu, Xiang-Sun Zhang, Ju-Liang Zhang
132
Voted
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 5 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos