Sciweavers

553 search results - page 88 / 111
» On Planar Path Transformation
Sort
View
EOR
2007
90views more  EOR 2007»
13 years 8 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 8 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
PAMI
1998
93views more  PAMI 1998»
13 years 8 months ago
Stereo Matching as a Nearest-Neighbor Problem
—We propose a representation of images, called intrinsic curves, that transforms stereo matching from a search problem into a nearest-neighbor problem. Intrinsic curves are the p...
Carlo Tomasi, Roberto Manduchi
PR
2007
134views more  PR 2007»
13 years 8 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
GLOBECOM
2010
IEEE
13 years 6 months ago
Admission Control and Channel Allocation for Supporting Real-Time Applications in Cognitive Radio Networks
Abstract--Proper admission control in cognitive radio networks is critical in providing QoS guarantees to secondary unlicensed users. In this paper, we study the admission control ...
Feng Wang, Junhua Zhu, Jianwei Huang, Yuping Zhao