15033 search results - page 2810 / 3007 » Complexity Theory and Algorithms |
155
click to vote
PKDD
2010
Springer
15 years 3 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...
144
click to vote
SPIRE
2010
Springer
15 years 3 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
145
click to vote
SSS
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
147
Voted
TPDS
2010
15 years 2 months ago
2010
—We propose FIT, a flexible, lightweight, and real-time scheduling system for wireless sensor platforms. There are three salient features of FIT. First, its two-tier hierarchical...
141
click to vote
TVCG
2010
15 years 2 months ago
2010
As data sources become larger and more complex, the ability to effectively explore and analyze patterns amongst varying sources becomes a critical bottleneck in analytic reasoning...