Sciweavers

2430 search results - page 295 / 486
» Computing Tutte Polynomials
Sort
View
120
Voted
ISCAS
2003
IEEE
172views Hardware» more  ISCAS 2003»
15 years 9 months ago
Efficient symbol synchronization techniques using variable FIR or IIR interpolation filters
Maximum Likelihood estimation theory can be used to develop optimal timing recovery schemes for digital communication systems. Tunable digital interpolation filters are commonly ...
Martin Makundi, Timo I. Laakso
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
15 years 9 months ago
Analysis of the (1+1) EA for a Dynamically Bitwise Changing OneMax
Abstract. Although evolutionary algorithms (EAs) are often successfully used for the optimization of dynamically changing objective function, there are only very few theoretical re...
Stefan Droste
135
Voted
ICCS
2003
Springer
15 years 9 months ago
A Semantic Search Approach by Graph Matching with Negations and Inferences
Research on semantic search has become heated these years. In this paper we propose an approach focusing on searching for resources with descriptions. The knowledge representation ...
Kewei Tu, Jing Lu, Haiping Zhu, Guowei Liu, Yong Y...
137
Voted
LATA
2010
Springer
15 years 9 months ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
Christophe Costa Florêncio, Henning Fernau
TAMC
2010
Springer
15 years 8 months ago
Optimal Acceptors and Optimal Proof Systems
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
Edward A. Hirsch