2569 search results - page 105 / 514 » Approximate Objects and Approximate Theories |
167
click to vote
ICRA
2008
IEEE
16 years 24 days ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
134
click to vote
LICS
2005
IEEE
15 years 12 months ago
2005
IEEE
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
191
click to vote
NIPS
2008
15 years 7 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
142
click to vote
DIS
2001
Springer
15 years 11 months ago
2001
Springer
Scientists need customizable tools to help them with discovery. We present an adjustable heuristic function for scientific discovery. This function may be considered in either a Mi...
167
click to vote
JMLR
2010
15 years 1 months ago
2010
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...