Sciweavers

1578 search results - page 291 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
GLOBECOM
2007
IEEE
14 years 4 months ago
Initialization Techniques for Improved Convergence of LMS DFEs in Strong Interference Environments
— The least-mean square (LMS) decision-feedback equalizer (DFE) was previously shown [1], [2] to possess an extended convergence time in an interference limited environment. In [...
Arun Batra, James R. Zeidler, Aloysius A. Beex
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
14 years 4 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
GRC
2010
IEEE
13 years 11 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 10 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
WWW
2008
ACM
14 years 10 months ago
Facetnet: a framework for analyzing communities and their evolutions in dynamic networks
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social network...
Yu-Ru Lin, Yun Chi, Shenghuo Zhu, Hari Sundaram, B...