Sciweavers

1689 search results - page 128 / 338
» Proximate point searching
Sort
View
CIMCA
2005
IEEE
15 years 11 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
166
Voted
IWIA
2005
IEEE
15 years 11 months ago
Forensic Analysis of File System Intrusions Using Improved Backtracking
Intrusion detection systems alert the system administrators of intrusions but, in most cases, do not provide details about which system events are relevant to the intrusion and ho...
Sriranjani Sitaraman, Subbarayan Venkatesan
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
16 years 7 months ago
Nearest Surrounder Queries
In this paper, we study a new type of spatial query, Nearest Surrounder (NS), which searches the nearest surrounding spatial objects around a query point. NS query can be more use...
Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
16 years 5 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 6 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount