752 search results - page 141 / 151 » Faster approximation algorithms for the minimum latency prob... |
PKDD
1999
Springer
13 years 11 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
OPODIS
2004
13 years 8 months ago
2004
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
KDD
2012
ACM
11 years 9 months ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
AAAI
2008
13 years 9 months ago
2008
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...