1091 search results - page 122 / 219 » Approximation Algorithms for Data Placement Problems |
135
click to vote
WWW
2011
ACM
14 years 9 months ago
2011
ACM
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
142
Voted
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...
114
Voted
PROCEDIA
2010
15 years 1 months ago
2010
This study is devoted to exploring possible applications of GPU technology for acceleration of the database access. We use the n-gram based approximate text search engine as a tes...
129
Voted
IROS
2009
IEEE
15 years 9 months ago
2009
IEEE
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
96
Voted
NIPS
2007
15 years 4 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...