70 search results - page 9 / 14 » Frequency-distance constraints with large distances |
122
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
116
click to vote
RTSS
2007
IEEE
15 years 6 months ago
2007
IEEE
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, th...
TMC
2008
14 years 11 months ago
2008
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, the ...
95
Voted
DAC
1997
ACM
15 years 3 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
105
click to vote
MP
2006
14 years 11 months ago
2006
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...