Sciweavers

1243 search results - page 62 / 249
» Complexity reduction of C-Algorithm
Sort
View
TSP
2011
152views more  TSP 2011»
14 years 8 months ago
Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation and Switched
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
Rodrigo C. de Lamare, Raimundo Sampaio Neto, Marti...
ESIAT
2009
IEEE
14 years 11 months ago
Research and Realization of Geospatial Information Service Orchestration Based on BPEL
Geospatial information services composition is a promising approach to construct complex Web GIS applications. BPEL, which is the language and the industry standard that expresses ...
Xiaoliang Meng, Fuling Bian, Yichun Xie
MEMICS
2010
14 years 8 months ago
Modeling Gene Networks using Fuzzy Logic
Recently, almost uncontrolled technological progress allows so called high-throughput data collection for sophisticated and complex experimental biological systems analysis. Espec...
Artur Gintrowski
MFCS
2004
Springer
15 years 6 months ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier
CSL
2001
Springer
15 years 5 months ago
On a Generalisation of Herbrand's Theorem
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...
Matthias Baaz, Georg Moser