Sciweavers

642 search results - page 115 / 129
» Approximation Algorithms for Minimum K-Cut
Sort
View
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
14 years 2 days ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
IPSN
2007
Springer
14 years 1 months ago
Energy-optimized image communication on resource-constrained sensor platforms
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
Dong-U Lee, Hyungjin Kim, Steven Tu, Mohammad H. R...
GLOBECOM
2006
IEEE
14 years 1 months ago
Distributed Formation of Overlapping Multi-hop Clusters in Wireless Sensor Networks
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
Adel M. Youssef, Mohamed F. Younis, Moustafa Youss...
ICRA
2006
IEEE
111views Robotics» more  ICRA 2006»
14 years 1 months ago
Placement and Distributed Deployment of Sensor Teams for Triangulation based Localization
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
Volkan Isler
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
14 years 1 days ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg