Sciweavers

1404 search results - page 152 / 281
» Optimization problems in multiple-interval graphs
Sort
View
TASE
2010
IEEE
14 years 4 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
PODS
2001
ACM
135views Database» more  PODS 2001»
15 years 10 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
GLOBECOM
2009
IEEE
15 years 4 months ago
Strong Barrier Coverage with Directional Sensors
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
Li Zhang, Jian Tang, Weiyi Zhang
CVPR
1997
IEEE
15 years 2 months ago
Normalized Cuts and Image Segmentation
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
Jianbo Shi, Jitendra Malik
BROADNETS
2005
IEEE
15 years 3 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz