Sciweavers

3708 search results - page 60 / 742
» Approximating Betweenness Centrality
Sort
View
138
Voted
TNN
2010
216views Management» more  TNN 2010»
14 years 7 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
104
Voted
DASFAA
2005
IEEE
136views Database» more  DASFAA 2005»
15 years 6 months ago
Distributed Intersection Join of Complex Interval Sequences
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SASO
2008
IEEE
15 years 7 months ago
Self-Adaptive Dissemination of Data in Dynamic Sensor Networks
The distribution of data in large dynamic wireless sensor networks presents a difficult problem due to node mobility, link failures, and traffic congestion. In this paper, we pr...
David Dorsey, Bjorn Jay Carandang, Moshe Kam, Chri...
101
Voted
VTC
2008
IEEE
224views Communications» more  VTC 2008»
15 years 7 months ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang
ICNP
1999
IEEE
15 years 4 months ago
A Distributed Scheduling Algorithm for Quality of Service Support in Multiaccess Networks
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...
Craig Barrack, Kai-Yeung Siu