Sciweavers

220 search results - page 23 / 44
» Primal-Dual Algorithms for Connected Facility Location Probl...
Sort
View
ICDAR
2005
IEEE
15 years 5 months ago
Text Extraction from Gray Scale Historical Document Images Using Adaptive Local Connectivity Map
This paper presents an algorithm using adaptive local connectivity map for retrieving text lines from the complex handwritten documents such as handwritten historical manuscripts....
Zhixin Shi, Srirangaraj Setlur, Venu Govindaraju
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 3 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
SIGMOD
2010
ACM
210views Database» more  SIGMOD 2010»
14 years 12 months ago
Searching trajectories by locations: an efficiency study
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...
COR
2006
94views more  COR 2006»
14 years 11 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
ML
2008
ACM
156views Machine Learning» more  ML 2008»
14 years 11 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani