Sciweavers

16666 search results - page 2600 / 3334
» Descriptive and Computational Complexity
Sort
View
DATAMINE
2006
166views more  DATAMINE 2006»
15 years 7 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
IDA
2006
Springer
15 years 7 months ago
Structural hidden Markov models: An application to handwritten numeral recognition
We introduce in this paper a generalization of the widely used hidden Markov models (HMM's), which we name "structural hidden Markov models" (SHMM). Our approach is ...
Djamel Bouchaffra, Jun Tan
CLUSTER
2007
IEEE
15 years 7 months ago
Combining data sharing with the master-worker paradigm in the common component architecture
Abstract— Software component technologies are being accepted as an adequate solution for handling the complexity of applications. However, existing software component models tend...
Gabriel Antoniu, Hinde-Lilia Bouziane, Mathieu Jan...
IJES
2006
134views more  IJES 2006»
15 years 7 months ago
Applying model-driven development to distributed real-time and embedded avionics systems
Model-driven development (MDD) is an emerging paradigm that uses domain-specific modeling languages (DSMLs) and generative technologies to provide "correct-by-construction&quo...
Krishnakumar Balasubramanian, Arvind S. Krishna, E...
COR
2007
87views more  COR 2007»
15 years 7 months ago
An exact algorithm for generating homogenous T-shape cutting patterns
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
Yaodong Cui
« Prev « First page 2600 / 3334 Last » Next »