Sciweavers

389 search results - page 9 / 78
» Some natural decision problems in automatic graphs
Sort
View
ETRICS
2006
13 years 11 months ago
Privacy-Preserving Decision Tree Mining Based on Random Substitutions
Privacy-preserving decision tree mining is an important problem that has yet to be thoroughly understood. In fact, the privacypreserving decision tree mining method explored in the...
Jim Dowd, Shouhuai Xu, Weining Zhang
ISMIS
2005
Springer
14 years 26 days ago
Estimation of the Density of Datasets with Decision Diagrams
We address the problem of loading transactional datasets into main memory and estimating the density of such datasets. We propose BoolLoader, an algorithm dedicated to these tasks;...
Ansaf Salleb, Christel Vrain
EACL
2006
ACL Anthology
13 years 8 months ago
From Detecting Errors to Automatically Correcting Them
Faced with the problem of annotation errors in part-of-speech (POS) annotated corpora, we develop a method for automatically correcting such errors. Building on top of a successfu...
Markus Dickinson
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 4 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
NHM
2010
87views more  NHM 2010»
13 years 2 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...