We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
We propose a new real-time packet scheduling algorithm for streaming scalable H.264. Our algorithm makes use of a packet importance measure, which we define, that takes into cons...
Abstract— When grasping an object, friction forces are sometimes utilized. Because of this friction forces, the object is manipulable to various direction. In this paper, we disc...
Satoshi Ito, Yuuki Mizukoshi, Koji Ishihara, Minor...
Multiple antennas at the transmitter and the receiver have the potential to either increase the data rate through spatial multiplexing or enhance the quality of transmission throu...
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
Alexander Troussov, Brian O'Donovan, Seppo Koskenn...