Sciweavers

2740 search results - page 25 / 548
» Approximating Component Selection
Sort
View
IFIP
2007
Springer
15 years 3 months ago
A Framework for QoS Contract Negotiation in Component-Based Applications
The support of QoS properties in component-based software requires the run-time selection of appropriate concrete QoS contracts at the ports of the interacting components. Such a s...
Mesfin Mulugeta, Alexander Schill
IJON
2008
105views more  IJON 2008»
14 years 8 months ago
Estimating the number of components in a mixture of multilayer perceptrons
BIC criterion is widely used by the neural-network community for model selection tasks, although its convergence properties are not always theoretically established. In this paper...
Madalina Olteanu, Joseph Rynkiewicz
INTERSPEECH
2010
14 years 4 months ago
Improved language recognition using mixture components statistics
One successful approach to language recognition is to focus on the most discriminative high level features of languages, such as phones and words. In this paper, we applied a simi...
Abualsoud Hanani, Michael J. Carey 0002, Martin J....
CGF
2008
138views more  CGF 2008»
14 years 9 months ago
Geometry-Aware Framebuffer Level of Detail
This paper introduces a framebuffer level of detail algorithm for controlling the pixel workload in an interactive rendering application. Our basic strategy is to evaluate the sha...
Lei Yang, Pedro V. Sander, Jason Lawrence
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
15 years 1 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt