4377 search results - page 263 / 876 » Mass problems and randomness |
170
click to vote
ICTAI
1999
IEEE
15 years 11 months ago
1999
IEEE
Recently there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, o...
170
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
191
click to vote
CISS
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract –In this paper, a new problem, consensus estimation, is formulated, whose setting is complementary to the well-known CEO problem. In particular, a set of nodes are emplo...
163
click to vote
JMLR
2010
15 years 1 months ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
168
click to vote
ACIVS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Feature subset selection is an important subject when training classifiers in Machine Learning (ML) problems. Too many input features in a ML problem may lead to the so-...