1301 search results - page 56 / 261 » Bounded Version Vectors |
300
click to vote
GIS
2006
ACM
16 years 6 months ago
2006
ACM
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...
170
click to vote
JCT
2006
15 years 5 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
153
click to vote
COCO
2009
Springer
16 years 3 days ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
139
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
140
click to vote
NIPS
2007
15 years 7 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...