1095 search results - page 92 / 219 » Preprocessing of Intractable Problems |
DAC
2008
ACM
15 years 11 months ago
2008
ACM
In this paper, a novel automatic approach for the concurrent topology and routing optimization that achieves a high quality network layout is proposed. This optimization is based ...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
BPM
2009
Springer
15 years 4 months ago
2009
Springer
The goal of process mining is to discover process models from event logs. However, for processes that are not well structured and have a lot of diverse behavior, existing process m...
WEA
2007
Springer
15 years 4 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
PKDD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Most real-world datasets are, to a certain degree, skewed. When considered that they are also large, they become the pinnacle challenge in data analysis. More importantly...