Sciweavers

1012 search results - page 7 / 203
» Segment intersection searching problems in general settings
Sort
View
CCCG
2009
13 years 8 months ago
Inapproximability of the Perimeter Defense Problem
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
Evangelos Kranakis, Danny Krizanc, Lata Narayanan,...
LION
2007
Springer
198views Optimization» more  LION 2007»
14 years 1 months ago
Multiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
Deon Garrett, Dipankar Dasgupta
IDEAS
2005
IEEE
113views Database» more  IDEAS 2005»
14 years 28 days ago
On the Intersection of XPath Expressions
— XPath is a common language for selecting nodes in an XML document. XPath uses so called path expressions which describe a navigation path through semistructured data. In the la...
Beda Christoph Hammerschmidt, Martin Kempa, Volker...
GIS
2005
ACM
14 years 8 months ago
Automatic extraction of road intersections from raster maps
Numerous raster maps are available on the Internet, but the geographic coordinates of the maps are often unknown. In order to determine the precise location of a raster map, we ex...
Yao-Yi Chiang, Craig A. Knoblock, Ching-Chien Chen
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 7 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro