Sciweavers

18155 search results - page 174 / 3631
» Point
Sort
View
131
Voted
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
15 years 3 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi
IMC
2007
ACM
15 years 3 months ago
Passive online rogue access point detection using sequential hypothesis testing with TCP ACK-pairs
Rogue (unauthorized) wireless access points pose serious security threats to local networks. In this paper, we propose two online algorithms to detect rogue access points using se...
Wei Wei, Kyoungwon Suh, Bing Wang, Yu Gu, Jim Kuro...
101
Voted
CCCG
2008
15 years 3 months ago
Recognition of Largest Empty Orthoconvex Polygon in a Point Set
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...
Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab...
122
Voted
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
15 years 3 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
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...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
MM
2010
ACM
121views Multimedia» more  MM 2010»
15 years 2 months ago
Implementation and demonstration of a credit-based home access point
The increasing availability of high speed Internet access and the decreasing cost of wireless technologies has increased the number of devices in the home that wirelessly connect ...
Choong-Soo Lee, Mark Claypool, Robert E. Kinicki