10 search results - page 2 / 2 » On the Range Maximum-Sum Segment Query Problem |
114
Voted
ECIR
2007
Springer
15 years 2 months ago
2007
Springer
Measuring the similarity between documents and queries has been extensively studied in information retrieval. However, there are a growing number of tasks that require computing th...
117
Voted
ICCSA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
119
Voted
SODA
1997
ACM
15 years 2 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
105
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
135
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...