Sciweavers

4781 search results - page 67 / 957
» Complexity at large
Sort
View
EDBT
2004
ACM
172views Database» more  EDBT 2004»
14 years 7 months ago
Efficient Similarity Search for Hierarchical Data in Large Databases
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures inclu...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...
GLOBECOM
2010
IEEE
13 years 5 months ago
Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...
N. Srinidhi, Tanumay Datta, Ananthanarayanan Chock...
ICC
2009
IEEE
14 years 2 months ago
A Training-Based Iterative Detection/Channel Estimation Scheme for Large Non-Orthogonal STBC MIMO Systems
Abstract—In this paper, we propose a training-based channel estimation scheme for large non-orthogonal space-time block coded (STBC) MIMO systems. The proposed scheme employs a b...
Ahmed Zaki, Saif K. Mohammed, Ananthanarayanan Cho...
IPPS
1998
IEEE
13 years 12 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot
IPPS
2010
IEEE
13 years 5 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...