1813 search results - page 278 / 363 » Calculi of Approximation Spaces |
125
click to vote
ICDM
2005
IEEE
15 years 9 months ago
2005
IEEE
There has been increasing number of independently proposed randomization methods in different stages of decision tree construction to build multiple trees. Randomized decision tre...
132
click to vote
IMC
2005
ACM
15 years 9 months ago
2005
ACM
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
131
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
130
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
143
Voted
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...