Sciweavers

867 search results - page 7 / 174
» The Generalized Maximum Coverage Problem
Sort
View
AHSWN
2006
148views more  AHSWN 2006»
13 years 7 months ago
Geometric Chemotaxis: A Biologically-Inspired Framework for a Class of Wireless Coverage Problems
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
Hidayet Ozgur Sanli, Rahul Simha, Bhagirath Naraha...
IEEECIT
2006
IEEE
14 years 1 months ago
Information Coverage Configuration with Energy Preservation in Large Scale Wireless Sensor Networks
Coverage configuration is an important issue in large scale wireless sensor networks (WSNs). Existing coverage configuration methods are generally based on the concept of physical...
Hongxing Bai, Xi Chen, Yu-Chi Ho, Xiaohong Guan
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
14 years 8 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
COLT
2006
Springer
13 years 11 months ago
Maximum Entropy Distribution Estimation with Generalized Regularization
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
Miroslav Dudík, Robert E. Schapire
AMAI
2008
Springer
13 years 8 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka