Sciweavers

661 search results - page 106 / 133
» Local Approximation Algorithms for Scheduling Problems in Se...
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 1 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
CDC
2008
IEEE
204views Control Systems» more  CDC 2008»
14 years 3 months ago
Dynamic ping optimization for surveillance in multistatic sonar buoy networks with energy constraints
— In this paper we study the problem of dynamic optimization of ping schedule in an active sonar buoy network deployed to provide persistent surveillance of a littoral area throu...
Anshu Saksena, I-Jeng Wang
ROBOCOMM
2007
IEEE
14 years 2 months ago
Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
Marco Pavone, Nabhendra Bisnik, Emilio Frazzoli, V...
ADHOC
2008
103views more  ADHOC 2008»
13 years 8 months ago
Impact of sensor-enhanced mobility prediction on the design of energy-efficient localization
Energy efficiency and positional accuracy are often contradictive goals. We propose to decrease power consumption without sacrificing significant accuracy by developing an energy-...
Chuang-Wen You, Polly Huang, Hao-Hua Chu, Yi-Chao ...
DC
2010
13 years 8 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer