Sciweavers

1897 search results - page 310 / 380
» Conditional Linear Planning
Sort
View
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
15 years 4 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
92
Voted
ICASSP
2009
IEEE
15 years 4 months ago
GTD-based transceivers for decision feedback and bit loading
We consider new optimization problems for transceivers with DFE receivers and linear precoders, which also use bit loading at the transmitter. First, we consider the MIMO QoS (qual...
Ching-Chih Weng, Chun-Yang Chen, P. P. Vaidyanatha...
DELTA
2004
IEEE
15 years 4 months ago
Spectral Warping Revisited
Spectral warping is a time domain to time domain transformation on a signal that effectively warps the frequency content of the original signal. Here we present a matrix formulati...
Donald G. Bailey, Warwick Allen, Serge N. Demidenk...
102
Voted
CIT
2006
Springer
15 years 4 months ago
A Contention Window Based Differentiation Mechanism for providing QoS in Wireless LANs
Running real time applications over wireless LANs is becoming common place. These applications require QoS. But the most widely used wireless LAN, IEEE 802.11, does not have QoS s...
Mayank Mishra, Anirudha Sahoo
CP
2006
Springer
15 years 4 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi