Sciweavers

543 search results - page 38 / 109
» New Upper Bounds for MaxSat
Sort
View
ICASSP
2008
IEEE
15 years 4 months ago
Robust adaptive beamforming using sequential quadratic programming
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
Aboulnasr Hassanien, Sergiy A. Vorobyov, Kon Max W...
56
Voted
ICMCS
2005
IEEE
86views Multimedia» more  ICMCS 2005»
15 years 3 months ago
A Perceptual Performance Measure for Adaptive Echo Cancellers in Packet-Based Telephony
This paper investigates performance measures of adaptive echo cancellers for packet-based telephony. It is shown that steady-state echo return loss enhancement (ERLE) does not acc...
James D. Gordy, Rafik A. Goubran
ACL
1990
14 years 11 months ago
An Efficient Parsing Algorithm for Tree Adjoining Grammars
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
Karin Harbusch
TRANSCI
2010
101views more  TRANSCI 2010»
14 years 8 months ago
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
Sumit Kunnumkal, Huseyin Topaloglu
AAAI
1997
14 years 11 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht