Sciweavers

39 search results - page 6 / 8
» Average Bit-Complexity of Euclidean Algorithms
Sort
View
ML
2010
ACM
142views Machine Learning» more  ML 2010»
13 years 5 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain
FOCS
1993
IEEE
13 years 11 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
MUE
2007
IEEE
190views Multimedia» more  MUE 2007»
14 years 1 months ago
On Clustering Multimedia Time Series Data Using K-Means and Dynamic Time Warping
After the generation of multimedia data turned digital, an explosion of interest in their data storage, retrieval, and processing has drastically increased. This includes videos, ...
Vit Niennattrakul, Chotirat Ann Ratanamahatana
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 7 months ago
A New Phase Transition for Local Delays in MANETs
: We study a slotted version of the Aloha Medium Access (MAC) protocol in a Mobile Ad-hoc Network (MANET). Our model features transmitters randomly located in the Euclidean plane, ...
François Baccelli, Bartek Blaszczyszyn
GLOBECOM
2007
IEEE
14 years 1 months ago
Iterative Decoding of Concatenated Channel Coding and Trellis Shaping Based on Markov Model
—The trellis shaping (TS) is an effective technique not only for average power reduction of high-order QAM signals, but also for peak power reduction of band-limited single-carri...
Makoto Tanahashi, Hideki Ochiai