Sciweavers

204 search results - page 17 / 41
» Parameterized Complexity of Cardinality Constrained Optimiza...
Sort
View
INFOCOM
1997
IEEE
13 years 11 months ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
GRAMMARS
2002
119views more  GRAMMARS 2002»
13 years 7 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
STACS
2010
Springer
14 years 14 days ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
TASLP
2010
153views more  TASLP 2010»
13 years 5 months ago
On Optimal Frequency-Domain Multichannel Linear Filtering for Noise Reduction
Abstract—Several contributions have been made so far to develop optimal multichannel linear filtering approaches and show their ability to reduce the acoustic noise. However, th...
Mehrez Souden, Jacob Benesty, Sofiène Affes
PVLDB
2008
89views more  PVLDB 2008»
13 years 6 months ago
Constrained physical design tuning
Abstract Existing solutions to the automated physical design problem in database systems attempt to minimize execution costs of input workloads for a given storage constraint. In t...
Nicolas Bruno, Surajit Chaudhuri