Sciweavers

1672 search results - page 261 / 335
» Tightness problems in the plane
Sort
View
COMGEO
2006
ACM
13 years 9 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
JALC
2006
143views more  JALC 2006»
13 years 9 months ago
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
Oscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gere...
MST
2002
107views more  MST 2002»
13 years 9 months ago
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
MP
1998
105views more  MP 1998»
13 years 9 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
CVPR
2009
IEEE
15 years 4 months ago
Active Stereo Tracking of Multiple Free-Moving Targets
This article presents a general approach for the active stereo tracking of multiple moving targets. The problem is formulated on the plane, where cameras are modeled as ”line ...
Helder Araújo, João P. Barreto, Luis...