Sciweavers

727 search results - page 56 / 146
» One line and n points
Sort
View
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 1 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
DMDW
2000
101views Management» more  DMDW 2000»
14 years 11 months ago
Metadata for object-relational data warehouse
For developing data warehouse (DW) and OnLine Analytical Processing (OLAP) systems, the dominant relational database reaches its limitations. On the way of the development, object...
Thanh N. Huynh, Oscar Mangisengi, A. Min Tjoa
CSDA
2008
150views more  CSDA 2008»
14 years 10 months ago
Unimodal regression via prefix isotonic regression
This paper gives algorithms for determining real-valued univariate unimodal regressions, that is, for determining the optimal regression which is increasing and then decreasing. S...
Quentin F. Stout
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
14 years 11 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
ESA
2010
Springer
133views Algorithms» more  ESA 2010»
14 years 11 months ago
Balancing Degree, Diameter and Weight in Euclidean Spanners
Abstract. In a seminal STOC'95 paper, Arya et al. [4] devised a construction that for any set S of n points in Rd and any > 0, provides a (1 + )-spanner with diameter O(lo...
Shay Solomon, Michael Elkin