3172 search results - page 361 / 635 » On the Random-Self-Reducibility of Complete Sets |
173
click to vote
APPINF
2003
15 years 8 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
189
click to vote
IM
2003
15 years 8 months ago
2003
Abstract: A probabilistic event-driven fault localization technique is presented, which uses a symptom-fault map as a fault propagation model. The technique isolates the most proba...
189
click to vote
WOB
2004
15 years 8 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
158
click to vote
COLING
1992
15 years 8 months ago
1992
No one has come up with a completely satisfactory set of deep cases relations (or thematic relations). The underlying reason is that any finite set of case relations can capture o...
150
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...