K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
Alejandro Ribeiro, Georgios B. Giannakis, Zhi-Quan...
Abstract— For multi-user orthogonal frequency division multiplexing (OFDM) systems, efficient optimal rate and power allocation algorithms are presented via geometric programmin...
Kibeom Seong, David D. Yu, Youngjae Kim, John M. C...
Abstract— The vibratory bowl feeder remains the most common approach to the automated feeding (orienting) of industrial parts. We study the algorithmic design of devices on the b...
Onno C. Goemans, Kenneth Y. Goldberg, A. Frank van...