Sciweavers

157 search results - page 26 / 32
» Randomized Algorithms for Minimum Distance Localization
Sort
View
STACS
2009
Springer
14 years 2 months ago
On Approximating Multi-Criteria TSP
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
Bodo Manthey
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 9 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
DAC
2007
ACM
14 years 8 months ago
An Effective Guidance Strategy for Abstraction-Guided Simulation
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
Flavio M. de Paula, Alan J. Hu
FSTTCS
2004
Springer
14 years 1 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
IDEAS
2008
IEEE
256views Database» more  IDEAS 2008»
14 years 2 months ago
WIDS: a sensor-based online mining wireless intrusion detection system
This paper proposes WIDS, a wireless intrusion detection system, which applies data mining clustering technique to wireless network data captured through hardware sensors for purp...
Christie I. Ezeife, Maxwell Ejelike, Akshai K. Agg...