1760 search results - page 40 / 352 » Connected Set Cover Problem and Its Applications |
PR
2006
13 years 7 months ago
2006
The performance of many supervised and unsupervised learning algorithms is very sensitive to the choice of an appropriate distance metric. Previous work in metric learning and ada...
SENSYS
2009
ACM
14 years 2 months ago
2009
ACM
Wireless sensor networks have been proposed for many location-dependent applications. In such applications, the requirement of low system cost prohibits many range-based methods f...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
ICCCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
ICFEM
2000
Springer
13 years 11 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...