Sciweavers

2194 search results - page 146 / 439
» Improving HLRTA*( k )
Sort
View
ICASSP
2008
IEEE
15 years 8 months ago
OFDM for underwater acoustic communications: Adaptive synchronization and sparse channel estimation
A phase synchronizationmethod, which provides non-uniform frequency offset compensation needed for wideband OFDM [1], is coupled with low-complexity channel estimation in the time...
Milica Stojanovic
COCOON
2005
Springer
15 years 7 months ago
Opportunistic Data Structures for Range Queries
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
Chung Keung Poon, Wai Keung Yiu
IEEEICCI
2003
IEEE
15 years 7 months ago
Automatic Concept Evolution
An evolutionary algorithm can be used by a distributed group of interacting people to produce the solution to a problem. First the problem must be defined. Each member of the grou...
Terence C. Fogarty
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
15 years 8 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...
IWPEC
2009
Springer
15 years 8 months ago
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
Henning Fernau, Joachim Kneis, Dieter Kratsch, Ale...