951 search results - page 67 / 191 » On the Computation of Correctly-Rounded Sums |
146
click to vote
CCCG
2008
15 years 5 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
126
click to vote
DLT
2008
15 years 5 months ago
2008
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
246
click to vote
ACL
2003
15 years 5 months ago
2003
This paper proposes the “Hierarchical Directed Acyclic Graph (HDAG) Kernel” for structured natural language data. The HDAG Kernel directly accepts several levels of both chunk...
123
click to vote
AAAI
1990
15 years 5 months ago
1990
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...
137
click to vote
PAA
2008
15 years 4 months ago
2008
Abstract Features computed as statistics (e.g. histograms) of local filter responses have been reported as the most powerful descriptors for texture classification and segmentation...