Sciweavers

901 search results - page 4 / 181
» Analyzing linear mergers
Sort
View
ENTCS
2008
103views more  ENTCS 2008»
13 years 8 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya
ECIS
2003
13 years 9 months ago
Conditions for change related to groupware in a distributed organization - a case study
Groupware is often used in distributed organizations to support communication and coordination. Managers direct resources and set up goals for the deployment of groupware. It is h...
Jesper Simonsen, Jens Kaaber Pors
IEAAIE
2004
Springer
14 years 1 months ago
Data Mining Approach for Analyzing Call Center Performance
Abstract. The aim of our research was to apply well-known data mining techniques (such as linear neural networks, multi-layered perceptrons, probabilistic neural networks, classifi...
Marcin Paprzycki, Ajith Abraham, Ruiyuan Guo, Srin...
CVPR
2012
IEEE
11 years 11 months ago
Linear discriminative image processing operator analysis
In this paper, we propose a method to select a discriminative set of image processing operations for Linear Discriminant Analysis (LDA) as an application of the use of generating ...
Toru Tamaki, Bingzhi Yuan, Kengo Harada, Bisser Ra...
ICML
2004
IEEE
14 years 9 months ago
Automated hierarchical mixtures of probabilistic principal component analyzers
Many clustering algorithms fail when dealing with high dimensional data. Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it assumes a ...
Ting Su, Jennifer G. Dy