699 search results - page 93 / 140 » mc 2008 |
WCE
2007
15 years 1 months ago
2007
— Imputation of missing data is important in many areas, such as reducing non-response bias in surveys and maintaining medical documentation. Estimating the uncertainty inherent ...
104
click to vote
CSC
2008
15 years 2 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
103
click to vote
UAI
2004
15 years 1 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
117
Voted
DM
1999
15 years 6 days ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
115
click to vote
CSDA
2007
15 years 10 days ago
2007
In this paper we address the problem of selecting variables or features in a regression model in the presence of both additive (vertical) and leverage outliers. Since variable sel...