Results 1  10
of
4,321
Qualitative Estimation of Depth in Monocular Vision
 In Proceedings of the 4th International Workshop on Visual Form
, 2001
"... In this paper we propose two techniques to qualitatively estimate disrance in monocular vision. Two kinds of approaches are described, the former based on texture analysis and the latter on histogram inspection. Although both the methods allow only to determine whether a point within an image is ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we propose two techniques to qualitatively estimate disrance in monocular vision. Two kinds of approaches are described, the former based on texture analysis and the latter on histogram inspection. Although both the methods allow only to determine whether a point within an image
Determining Lyapunov Exponents from a Time Series
 Physica
, 1985
"... We present the first algorithms that allow the estimation of nonnegative Lyapunov exponents from an experimental time series. Lyapunov exponents, which provide a qualitative and quantitative characterization of dynamical behavior, are related to the exponentially fast divergence or convergence of n ..."
Abstract

Cited by 495 (1 self)
 Add to MetaCart
We present the first algorithms that allow the estimation of nonnegative Lyapunov exponents from an experimental time series. Lyapunov exponents, which provide a qualitative and quantitative characterization of dynamical behavior, are related to the exponentially fast divergence or convergence
Extensional versus intuitive reasoning: The conjunction fallacy in probability judgment
 Psychological Review
, 1983
"... Perhaps the simplest and the most basic qualitative law of probability is the conjunction rule: The probability of a conjunction, P(A&B), cannot exceed the probabilities of its constituents, P(A) and.P(B), because the extension (or the possibility set) of the conjunction is included in the exten ..."
Abstract

Cited by 461 (6 self)
 Add to MetaCart
Perhaps the simplest and the most basic qualitative law of probability is the conjunction rule: The probability of a conjunction, P(A&B), cannot exceed the probabilities of its constituents, P(A) and.P(B), because the extension (or the possibility set) of the conjunction is included
CREATION OF THE RATING OF STOCK MARKET ANALYTICAL SYSTEMS ON THE BASE OF EXPERT QUALITATIVE ESTIMATIONS
"... In this article the algorithms of creation of the rating of stock market analytical automated systems are proposed. They are based on Zahedi’s analytic hierarchy process modification in which triangular fuzzy numbers are used to transform qualitative expert estimations into quantitative ones. An exa ..."
Abstract
 Add to MetaCart
In this article the algorithms of creation of the rating of stock market analytical automated systems are proposed. They are based on Zahedi’s analytic hierarchy process modification in which triangular fuzzy numbers are used to transform qualitative expert estimations into quantitative ones
qualitative estimates of residual confounding [v1; ref status:
"... Nonrandomized studies typically cannot account forBackground: confounding from unmeasured factors. A method is presented that exploits the recentlyidentifiedMethod: phenomenon of “confounding amplification ” to produce, in principle, a quantitative estimate of total residual confounding resulting f ..."
Abstract
 Add to MetaCart
Nonrandomized studies typically cannot account forBackground: confounding from unmeasured factors. A method is presented that exploits the recentlyidentifiedMethod: phenomenon of “confounding amplification ” to produce, in principle, a quantitative estimate of total residual confounding resulting
Qualitative Estimations of Range and Motion Using §patiotemporal Textural Images
"... In this paper we model the problem of structure from motion as the range estimation with known motion First, we approximate the motion within a reasonable time interval as a 30 translation and thus some image transformations are applied to convert an arbitrary motion to a ID translation Second we ha ..."
Abstract
 Add to MetaCart
In this paper we model the problem of structure from motion as the range estimation with known motion First, we approximate the motion within a reasonable time interval as a 30 translation and thus some image transformations are applied to convert an arbitrary motion to a ID translation Second we
Kalman Filterbased Algorithms for Estimating Depth from Image Sequences
, 1989
"... Using known camera motion to estimate depth from image sequences is an important problem in robot vision. Many applications of depthfrommotion, including navigation and manipulation, require algorithms that can estimate depth in an online, incremental fashion. This requires a representation that ..."
Abstract

Cited by 259 (26 self)
 Add to MetaCart
Using known camera motion to estimate depth from image sequences is an important problem in robot vision. Many applications of depthfrommotion, including navigation and manipulation, require algorithms that can estimate depth in an online, incremental fashion. This requires a representation
How costly is financial (not economic) distress? Evidence from highly leveraged transactions that become distressed
 Journal of Finance
, 1998
"... This paper studies thirtyone highly leveraged transactions ~HLTs! that become financially, not economically, distressed. The net effect of the HLT and financial distress ~from pretransaction to distress resolution, market or industryadjusted! is to increase value slightly. This finding strongly s ..."
Abstract

Cited by 259 (5 self)
 Add to MetaCart
suggests that, overall, the HLTs of the late 1980s created value. We present quantitative and qualitative estimates of the ~direct and indirect! costs of financial distress and their determinants. We estimate financial distress costs to be 10 to 20 percent of firm value. For a subset of firms that do
The tradeoffs of large scale learning
 IN: ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 20
, 2008
"... This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for the case of smallscale and largescale learning problems. Smallscale learning problems are subject to the usual approx ..."
Abstract

Cited by 270 (4 self)
 Add to MetaCart
approximation–estimation tradeoff. Largescale learning problems are subject to a qualitatively different tradeoff involving the computational complexity of the underlying optimization algorithms in nontrivial ways.
Results 1  10
of
4,321