562 search results - page 108 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
CIKM
2007
Springer
14 years 2 months ago
2007
Springer
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
SIGECOM
2010
ACM
14 years 23 days ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
ATAL
2009
Springer
13 years 9 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...