Sciweavers

2095 search results - page 240 / 419
» Improved pebbling bounds
Sort
View
ICC
2007
IEEE
112views Communications» more  ICC 2007»
16 years 1 months ago
Algebraic Constructions of Space-Frequency Codes
— Recently an algebraic construction of (nt × Q) space-frequency (SF) codes over finite field Fq was proposed for use in MIMO-OFDM systems, where nt is the number of transmit ...
Mao-Ching Chiu, Hsiao-feng Lu
ICCCN
2007
IEEE
16 years 1 months ago
A Channel Assignment Algorithm for Multi-Radio Wireless Mesh Networks
—The focus of this paper is on wireless mesh networks. In particular, we study the multi-radio case, given the considerable improvement in network throughput that multiple radios...
Stefano Avallone, Ian F. Akyildiz
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
16 years 1 months ago
Anytime, Dynamic Planning in High-dimensional Search Spaces
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
Dave Ferguson, Anthony Stentz
COCOA
2007
Springer
16 years 26 days ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar
152
Voted
CSR
2007
Springer
16 years 25 days ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...