Sciweavers

4095 search results - page 270 / 819
» How to test a tree
Sort
View
EDOC
2009
IEEE
15 years 4 months ago
Monitoring and Analyzing Influential Factors of Business Process Performance
Abstract--Business activity monitoring enables continuous observation of key performance indicators (KPIs). However, if things go wrong, a deeper analysis of process performance be...
Branimir Wetzstein, Philipp Leitner, Florian Rosen...
113
Voted
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
14 years 11 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
122
Voted
AIME
1997
Springer
15 years 4 months ago
Detecting Very Early Stages of Dementia from Normal Aging with Machine Learning Methods
We used Machine Learning (ML) methods to learn the best decision rules to distinguish normal brain aging from the earliest stages of dementia using subsamples of 198 normal and 244...
William Rodman Shankle, Subramani Mani, Michael J....
97
Voted
EVOW
2006
Springer
15 years 4 months ago
Hierarchical Clustering, Languages and Cancer
In this paper, we introduce a novel objective function for the hierarchical clustering of data from distance matrices, a very relevant task in Bioinformatics. To test the robustnes...
Pritha Mahata, Wagner Costa, Carlos Cotta, Pablo M...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 1 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han