Sciweavers

1957 search results - page 158 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
JWSR
2007
89views more  JWSR 2007»
14 years 10 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
15 years 4 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...
TOMS
2008
87views more  TOMS 2008»
14 years 10 months ago
Efficient Contouring on Unstructured Meshes for Partial Differential Equations
We introduce three fast contouring algorithms for visualizing the solution of Partial Differential Equations based on the PCI (Pure Cubic Interpolant). The PCI is a particular pie...
Hassan Goldani-Moghaddam, Wayne H. Enright
ICASSP
2011
IEEE
14 years 1 months ago
Joint blind estimation of carrier phase and frequency offset for QAM signals using circular harmonic decomposition
An algorithm is presented for joint blind estimation of carrier phase and frequency offset for signals with quadrature amplitude modulation (QAM). The algorithm is based on a circ...
Alexander B. Sergienko, Alexander V. Petrov
KAIS
2006
110views more  KAIS 2006»
14 years 10 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...