Sciweavers

712 search results - page 90 / 143
» The Complexity of Constructing Evolutionary Trees Using Expe...
Sort
View
WINET
2010
128views more  WINET 2010»
15 years 1 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
DLOG
2007
15 years 5 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
TWC
2008
209views more  TWC 2008»
15 years 2 months ago
Application of Nonbinary LDPC Cycle Codes to MIMO Channels
In this paper, we investigate the application of nonbinary low-density parity-check (LDPC) cycle codes over Galois field GF(q) to multiple-input multiple-output (MIMO) channels. Tw...
Ronghui Peng, Rong-Rong Chen
ICASSP
2011
IEEE
14 years 6 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
ICML
1996
IEEE
16 years 3 months ago
Representing and Learning Quality-Improving Search Control Knowledge
Generating good, production-quality plans is an essential element in transforming planners from research tools into real-world applications, but one that has been frequently overl...
M. Alicia Pérez