277 search results - page 52 / 56 » The saga of minimum spanning trees |
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
ICCCN
2008
IEEE
14 years 1 months ago
2008
IEEE
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...