Sciweavers

870 search results - page 20 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
RTCSA
2008
IEEE
14 years 2 months ago
Real-Time Communications Over Cluster-Tree Sensor Networks with Mobile Sink Behaviour
· Modelling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand the behaviour of WSN under worst-case conditions and to...
Petr Jurcík, Ricardo Severino, Anis Koubaa,...
TCAD
2002
93views more  TCAD 2002»
13 years 8 months ago
Hierarchical buffered routing tree generation
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
Amir H. Salek, Jinan Lou, Massoud Pedram
CORR
2012
Springer
216views Education» more  CORR 2012»
12 years 4 months ago
Fractional Moments on Bandit Problems
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit proble...
Ananda Narayanan B., Balaraman Ravindran
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
14 years 2 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang