Sciweavers

901 search results - page 4 / 181
» Analyzing linear mergers
Sort
View
ENTCS
2008
103views more  ENTCS 2008»
14 years 10 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
14 years 11 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
98
Voted
IEAAIE
2004
Springer
15 years 3 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...
122
Voted
CVPR
2012
IEEE
13 years 21 days 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...
78
Voted
ICML
2004
IEEE
15 years 11 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