Sciweavers

2924 search results - page 219 / 585
» Lower Bounds in Distributed Computing
Sort
View
SPIESR
1997
97views Database» more  SPIESR 1997»
15 years 4 months ago
Multiscale Branch-and-Bound Image Database Search
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
Jau-Yuen Chen, Charles A. Bouman, Jan P. Allebach
144
Voted
CDC
2010
IEEE
125views Control Systems» more  CDC 2010»
14 years 7 months ago
Persistent patrol with limited-range on-board sensors
— We propose and analyze the Persistent Patrol Problem (PPP). An unmanned aerial vehicle (UAV) moving with constant speed and unbounded acceleration patrols a bounded region of t...
Vu Anh Huynh, John Enright, Emilio Frazzoli
NETWORKING
2004
15 years 4 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda
JSAC
2008
85views more  JSAC 2008»
15 years 3 months ago
A distributed minimum variance estimator for sensor networks
A distributed estimation algorithm for sensor networks is proposed. A noisy time-varying signal is jointly tracked by a network of sensor nodes, in which each node computes its es...
Alberto Speranzon, Carlo Fischione, Karl Henrik Jo...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 3 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi