4894 search results - page 795 / 979 » The Guarding Problem - Complexity and Approximation |
147
Voted
SDM
2010
SIAM
15 years 29 days ago
2010
SIAM
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
114
Voted
MOBIHOC
2010
ACM
15 years 14 days ago
2010
ACM
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
140
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...
114
Voted
JSAC
2011
14 years 5 months ago
2011
—We consider a communication channel with two transmitters and one receiver, with an underlying rate region which is approximated as a general pentagon. Different from the Gaussi...
126
Voted
TON
2012
13 years 5 months ago
2012
—The inherent measurement support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problem...