2740 search results - page 212 / 548 » Approximating Component Selection |
120
Voted
SMA
1997
ACM
15 years 7 months ago
1997
ACM
Much of recent research in representation schemes for solid modeling was focused on the extension of boundary representations to support non-manifold topologies. We introduce here...
130
Voted
AAAI
2007
15 years 5 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
111
Voted
SIROCCO
2008
15 years 4 months ago
2008
In this paper we examine the diffusion of competing rumors in social networks. Two players select a disjoint subset of nodes as initiators of the rumor propagation, seeking to maxi...
134
Voted
ESANN
2004
15 years 4 months ago
2004
In this paper we present a simple hierarchical Bayesian treatment of the sparse kernel logistic regression (KLR) model based MacKay's evidence approximation. The model is re-p...
114
Voted
NIPS
1998
15 years 4 months ago
1998
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered re...