Sciweavers

942 search results - page 149 / 189
» Distance Constraint Satisfaction Problems
Sort
View
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 8 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 5 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SECON
2007
IEEE
15 years 9 months ago
Coverage Problem for Sensors Embedded in Temperature Sensitive Environments
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
Arunabha Sen, Nibedita Das, Ling Zhou, Bao Hong Sh...
129
Voted
ALGOSENSORS
2009
Springer
15 years 10 months ago
Building a Communication Bridge with Mobile Hubs
We study scenarios where mobile hubs are charged with building a communication bridge between two given points s and t. We introduce a new bi-criteria optimization problem where th...
Onur Tekdas, Yokesh Kumar, Volkan Isler, Ravi Jana...
TCOM
2010
131views more  TCOM 2010»
15 years 1 months ago
Distance-based node activation for geographic transmissions in fading channels
In wireless multi-hop packet radio networks (MPRNs) that employ geographic transmissions, sleep schedules or node activation techniques may be used to power off some nodes to cons...
Tathagata D. Goswami, John M. Shea, Murali Rao, Jo...