Sciweavers

5114 search results - page 759 / 1023
» Complex networks
Sort
View
NIPS
1994
15 years 8 months ago
Efficient Methods for Dealing with Missing Data in Supervised Learning
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
Volker Tresp, Ralph Neuneier, Subutai Ahmad
CIDR
2009
102views Algorithms» more  CIDR 2009»
15 years 7 months ago
Why Did My Query Slow Down
Enterprise environments have isolated teams responsible separately for database management and the management of underlying networkattached server-storage infrastructure (referred...
Nedyalko Borisov, Sandeep Uttamchandani, Ramani Ro...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 7 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
ICML
2010
IEEE
15 years 7 months ago
Probabilistic Backward and Forward Reasoning in Stochastic Relational Worlds
Inference in graphical models has emerged as a promising technique for planning. A recent approach to decision-theoretic planning in relational domains uses forward inference in d...
Tobias Lang, Marc Toussaint
ICASSP
2010
IEEE
15 years 6 months ago
Texas Hold 'Em algorithms for distributed compressive sensing
This paper develops a new class of algorithms for signal recovery in the distributed compressive sensing (DCS) framework. DCS exploits both intra-signal and inter-signal correlati...
Stephen R. Schnelle, Jason N. Laska, Chinmay Hegde...