Sciweavers

3656 search results - page 158 / 732
» Compact Location Problems
Sort
View
161
Voted
PAKDD
2010
ACM
215views Data Mining» more  PAKDD 2010»
15 years 7 months ago
Mining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
Wenzhi Zhou, Hongyan Liu, Hong Cheng
130
Voted
ECAI
2008
Springer
15 years 6 months ago
New Results for Horn Cores and Envelopes of Horn Disjunctions
We provide a characterization of Horn cores for formulas in conjunctive normal form (CNF) and, based on it, a novel algorithm for computing Horn cores of disjunctions of Horn CNFs ...
Thomas Eiter, Kazuhisa Makino
ESANN
2006
15 years 6 months ago
Optimal design of hierarchical wavelet networks for time-series forecasting
The purpose of this study is to identify the Hierarchical Wavelet Neural Networks (HWNN) and select important input features for each sub-wavelet neural network automatically. Base...
Yuehui Chen, Bo Yang, Ajith Abraham
124
Voted
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 5 months ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
Neelesh Khanna Surender Baswana
IJAR
2007
107views more  IJAR 2007»
15 years 5 months ago
Hybrid possibilistic networks
Possibilistic networks are important tools for dealing with uncertain pieces of information. For multiplyconnected networks, it is well known that the inference process is a hard ...
Salem Benferhat, Salma Smaoui