1301 search results - page 7 / 261 » Bounded Version Vectors |
DCG
2007
14 years 9 months ago
2007
Any finite set X ⊂ Rd colored with d+3 2 colors, contains a rainbow subset Y ⊂ X, such that any ball that contains Y contains a positive fraction of the points of X. The bound...
73
Voted
JMLR
2002
14 years 9 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
98
Voted
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
SIROCCO
2007
14 years 11 months ago
2007
A set of input vectors S is conclusive if correct functionality for all input vectors is implied by correct functionality over vectors in S. We consider four functionalities of co...
175
click to vote
ICDE
1995
IEEE
15 years 11 months ago
1995
IEEE
We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we...