Sciweavers

2412 search results - page 304 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
IPL
2006
141views more  IPL 2006»
15 years 3 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
146
Voted
ACL
1997
15 years 4 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
146
Voted
ECCV
2004
Springer
15 years 9 months ago
Unbiased Errors-In-Variables Estimation Using Generalized Eigensystem Analysis
Recent research provided several new and fast approaches for the class of parameter estimation problems that are common in computer vision. Incorporation of complex noise model (mo...
Matthias Mühlich, Rudolf Mester
135
Voted
JAIR
2000
152views more  JAIR 2000»
15 years 3 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
148
Voted
TCOM
2010
167views more  TCOM 2010»
15 years 1 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho