1510 search results - page 148 / 302 » Upper Probabilities and Additivity |
140
click to vote
NIPS
2008
15 years 5 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
137
click to vote
CCCG
2004
15 years 5 months ago
2004
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
131
click to vote
EMNLP
2006
15 years 5 months ago
2006
This paper demonstrates how unsupervised techniques can be used to learn models of deep linguistic structure. Determining the semantic roles of a verb's dependents is an impo...
132
click to vote
GD
2008
Springer
15 years 5 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
157
click to vote
HPDC
2010
IEEE
15 years 4 months ago
2010
IEEE
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...