663 search results - page 48 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
JCM
2006
13 years 7 months ago
2006
There are many difficult challenges ahead in the design of an energy-efficient communication stack for wireless sensor networks. Due to the severe sensor node constraints, protocol...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
SIAMCOMP
2012
11 years 10 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
PAMI
2006
13 years 7 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...