451 search results - page 34 / 91 » On Parameterized Exponential Time Complexity |
136
click to vote
LICS
2005
IEEE
15 years 8 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
138
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
147
Voted
PPDP
2010
Springer
15 years 22 days ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
107
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—In this paper we propose a low complexity frequency domain channel estimator for pilot-symbol-assisted (PSA) orthogonal frequency division multiplexing (OFDM) systems in...
136
click to vote
AGP
1994
IEEE
15 years 7 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...