Sciweavers

INFOCOM
2005
IEEE
14 years 5 months ago
Downlink beamforming algorithms with inter-cell interference in cellular networks
— We study the issue of handling unknown inter-cell interference in multi-cell environments with antenna arrays at the base stations. First, we demonstrate that the presence of u...
Tianmin Ren, Richard J. La
INFOCOM
2005
IEEE
14 years 5 months ago
Joint congestion control and media access control design for ad hoc wireless networks
Abstract— We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix,...
Lijun Chen, Steven H. Low, John C. Doyle
ICPP
2005
IEEE
14 years 5 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
ICDM
2005
IEEE
125views Data Mining» more  ICDM 2005»
14 years 5 months ago
A Thorough Experimental Study of Datasets for Frequent Itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
Frédéric Flouvat, Fabien De Marchi, ...
ICDCSW
2005
IEEE
14 years 5 months ago
Available Bandwidth Detection with Improved Transport Control Algorithm for Heterogeneous Networks
∗ In this paper, we propose a transport control performance improvement algorithm in heterogeneous networks. This paper discusses some novel algorithms to estimate the available...
Fang Qi, Weijia Jia, Jie Wu
ICCV
2005
IEEE
14 years 5 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
FOCS
2005
IEEE
14 years 5 months ago
The Closest Substring problem with small distances
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
Dániel Marx
FIRBPERF
2005
IEEE
235views Algorithms» more  FIRBPERF 2005»
14 years 5 months ago
Performance Model Building of Pervasive Computing
Performance model building is essential to predict the ability of an application to satisfy given levels of performance or to support the search for viable alternatives. Using aut...
Andrea D'Ambrogio, Giuseppe Iazeolla
FIRBPERF
2005
IEEE
228views Algorithms» more  FIRBPERF 2005»
14 years 5 months ago
Design and Performance Evaluation of Mechanisms for Mobile-Devices Handoff Forecast
Emiliano Casalicchio, Valeria Cardellini, Salvator...