Sciweavers

8298 search results - page 113 / 1660
» On the Complexity of Numerical Analysis
Sort
View
AAAI
1990
15 years 7 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
SOCA
2008
IEEE
15 years 6 months ago
Log-based mining techniques applied to Web service composition reengineering
There is no doubt that SOA and BPM will continue to evolve dependently for the next ten years. Preparing common research infrastructures will require most important efforts of web ...
Walid Gaaloul, Karim Baïna, Claude Godart
TIT
1998
69views more  TIT 1998»
15 years 6 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.
ISOLA
2010
Springer
15 years 4 months ago
Ten Years of Performance Evaluation for Concurrent Systems Using CADP
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...
Nicolas Coste, Hubert Garavel, Holger Hermanns, Fr...
ICIAR
2009
Springer
15 years 4 months ago
A Robust Modular Wavelet Network Based Symbol Classifier
This paper presents a robust automatic shape classifier using modular wavelet networks (MWNs). A shape descriptor is constructed based on a combination of global geometric features...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...