Sciweavers

4714 search results - page 440 / 943
» The Complexity of Iterated Multiplication
Sort
View
133
Voted
VTC
2007
IEEE
16 years 1 months ago
Adaptive Conjugate Gradient DFEs for Wideband MIMO Systems Using Galerkin Projections
— Three new adaptive equalization algorithms for wireless systems operating over frequency selective MIMO channels are proposed. The problem of the MIMO DFE design is formulated ...
Vassilis Kekatos, Aris S. Lalos, Kostas Berberidis
HPCC
2007
Springer
16 years 1 months ago
Optimizing Performance of Automatic Training Phase for Application Performance Prediction in the Grid
Abstract. Automatic execution time prediction of the Grid applications plays a critical role in making the pervasive Grid more reliable and predictable. However, automatic executio...
Farrukh Nadeem, Radu Prodan, Thomas Fahringer
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
16 years 1 months ago
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
Sung Eun Bae, Tadao Takaoka
INFOCOM
2005
IEEE
16 years 14 days ago
Low-state fairness: lower bounds and practical enforcement
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...
Abhimanyu Das, Debojyoti Dutta, Ahmed Helmy, Ashis...
WISE
2005
Springer
16 years 13 days ago
Constructing Interface Schemas for Search Interfaces of Web Databases
Many databases have become Web-accessible through form-based search interfaces (i.e., search forms) that allow users to specify complex and precise queries to access the underlying...
Hai He, Weiyi Meng, Clement T. Yu, Zonghuan Wu