Sciweavers

12659 search results - page 2153 / 2532
» The distributed breakout algorithms
Sort
View
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
16 years 10 days ago
Average Case Analysis for Tree Labelling Schemes
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
16 years 10 days ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
ISMIR
2005
Springer
157views Music» more  ISMIR 2005»
16 years 10 days ago
Specmurt Analysis of Multi-Pitch Music Signals with Adaptive Estimation of Common Harmonic Structure
This paper describes a multi-pitch analysis method using specmurt analysis with iterative estimation of the quasioptimal common harmonic structure function. Specmurt analysis (Sag...
Shoichiro Saito, Hirokazu Kameoka, Takuya Nishimot...
MIDDLEWARE
2005
Springer
16 years 10 days ago
A reconfigurable group management middleware service for wireless sensor networks
Group management service plays a key role in wireless sensor networks (WSNs) as it provides support to high level middleware services such as object tracking, security, fault-tole...
Mardoqueu Vieira, Nelson Souto Rosa
PCI
2005
Springer
16 years 10 days ago
Towards In-Situ Data Storage in Sensor Databases
Abstract. The advances in wireless communications along with the exponential growth of transistors per integrated circuit lead to a rapid evolution of Wireless Sensor Devices (WSDs...
Demetrios Zeinalipour-Yazti, Vana Kalogeraki, Dimi...
« Prev « First page 2153 / 2532 Last » Next »