Sciweavers

70 search results - page 9 / 14
» Frequency-distance constraints with large distances
Sort
View
ECCV
2008
Springer
14 years 11 months ago
Quick Shift and Kernel Methods for Mode Seeking
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...
Andrea Vedaldi, Stefano Soatto
RTSS
2007
IEEE
14 years 4 months ago
Rendezvous Planning in Mobility-Assisted Wireless Sensor Networks
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...
Guoliang Xing, Tian Wang, Zhihui Xie, Weijia Jia
TMC
2008
156views more  TMC 2008»
13 years 9 months ago
Rendezvous Planning in Wireless Sensor Networks with Mobile Elements
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 ...
Guoliang Xing, Tian Wang, Zhihui Xie, Weijia Jia
DAC
1997
ACM
14 years 2 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao
MP
2006
138views more  MP 2006»
13 years 9 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
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...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...