Sciweavers

59 search results - page 9 / 12
» Analysis of greedy approximations with nonsubmodular potenti...
Sort
View
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 7 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 9 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
QEST
2009
IEEE
14 years 1 months ago
Comparison of Two Output Models for the BMAP/MAP/1 Departure Process
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
Qi Zhang, Armin Heindl, Evgenia Smirni, Andreas St...
IDEAL
2004
Springer
14 years 11 days ago
Exploiting Safety Constraints in Fuzzy Self-organising Maps for Safety Critical Applications
This paper defines a constrained Artificial Neural Network (ANN) that can be employed for highly-dependable roles in safety critical applications. The derived model is based upon t...
Zeshan Kurd, Tim P. Kelly, Jim Austin
DAGSTUHL
2004
13 years 8 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter