Sciweavers

628 search results - page 16 / 126
» The minimum shift design problem
Sort
View
DCOSS
2007
Springer
15 years 1 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
ICALP
2004
Springer
15 years 2 months ago
A Faster Algorithm for Minimum Cycle Basis of Graphs
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
ICASSP
2011
IEEE
14 years 1 months ago
On synthesizing cross ambiguity functions
The cross ambiguity function (CAF) arises in many areas such as radar/sonar and communications when correlation processing is performed in the presence of a Doppler frequency shif...
Hao He, Petre Stoica, Jian Li
115
Voted
CCCG
2003
14 years 11 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
15 years 9 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau