Results 1 - 10 of 41,164

Formal and real authority in organizations

by Jean Tirole - The Journal of Political Economy , 1997
"... This paper develops a theory of the allocation of formal authority (the right to decide) and real authority (the effective control over decisions) within organizations, and it illustrates how a formally integrated structure can accommodate various degrees of "real" integration. Real author ..."
Abstract - Cited by 856 (24 self) - Add to MetaCart
of formal authority within organizations, the paper examines a number of factors that increase the subordinates ' real authority in a formally integrated structure: overload, lenient rules, urgency of decision, reputation, performance measurement, and multiplicity of superiors. Finally, the amount

Reflectance and texture of real-world surfaces

by Kristin J. Dana, Bram van Ginneken, Shree K. Nayar, Jan J. Koenderink - ACM TRANS. GRAPHICS , 1999
"... In this work, we investigate the visual appearance of real-world surfaces and the dependence of appearance on scale, viewing direction and illumination direction. At ne scale, surface variations cause local intensity variation or image texture. The appearance of this texture depends on both illumina ..."
Abstract - Cited by 590 (23 self) - Add to MetaCart
In this work, we investigate the visual appearance of real-world surfaces and the dependence of appearance on scale, viewing direction and illumination direction. At ne scale, surface variations cause local intensity variation or image texture. The appearance of this texture depends on both

Performance of optical flow techniques

by J. L. Barron, D. J. Fleet, S. S. Beauchemin - INTERNATIONAL JOURNAL OF COMPUTER VISION , 1994
"... While different optical flow techniques continue to appear, there has been a lack of quantitative evaluation of existing methods. For a common set of real and synthetic image sequences, we report the results of a number of regularly cited optical flow techniques, including instances of differential, ..."
Abstract - Cited by 1325 (32 self) - Add to MetaCart
While different optical flow techniques continue to appear, there has been a lack of quantitative evaluation of existing methods. For a common set of real and synthetic image sequences, we report the results of a number of regularly cited optical flow techniques, including instances of differential

Finding community structure in networks using the eigenvectors of matrices

by M. E. J. Newman , 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract - Cited by 502 (0 self) - Add to MetaCart
. The algorithms and measures proposed are illustrated with applications to a variety of real-world complex networks.

Insensitivity to future consequences following damage to human prefrontal cortex.

by Antoine Bechara , Antonio R Damasio , Hanna Damasio , Steven W Anderson - Cognition, , 1994
"... Abstract Following damage to the ventromedial prefrontal cortex, humans develop a defect in real-life decision-making, which contrasts with otherwise normal intellectual functions. Currently, there is no neuropsychological probe to detect in the laboratory, and the cognitive and neural mechanisms r ..."
Abstract - Cited by 534 (14 self) - Add to MetaCart
Abstract Following damage to the ventromedial prefrontal cortex, humans develop a defect in real-life decision-making, which contrasts with otherwise normal intellectual functions. Currently, there is no neuropsychological probe to detect in the laboratory, and the cognitive and neural mechanisms

An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions

by Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu - ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS , 1994
"... Consider a set S of n data points in real d-dimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any po ..."
Abstract - Cited by 984 (32 self) - Add to MetaCart
Consider a set S of n data points in real d-dimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any

SURF: Speeded Up Robust Features

by Herbert Bay, Tinne Tuytelaars, Luc Van Gool - ECCV
"... Abstract. In this paper, we present a novel scale- and rotation-invariant interest point detector and descriptor, coined SURF (Speeded Up Ro-bust Features). It approximates or even outperforms previously proposed schemes with respect to repeatability, distinctiveness, and robustness, yet can be comp ..."
Abstract - Cited by 897 (12 self) - Add to MetaCart
be computed and compared much faster. This is achieved by relying on integral images for image convolutions; by building on the strengths of the leading existing detectors and descrip-tors (in casu, using a Hessian matrix-based measure for the detector, and a distribution-based descriptor); and by simplifying

Efficient graph-based image segmentation.

by Pedro F Felzenszwalb , Daniel P Huttenlocher - International Journal of Computer Vision, , 2004
"... Abstract. This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show ..."
Abstract - Cited by 940 (1 self) - Add to MetaCart
Abstract. This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show

Markov Logic Networks

by Matthew Richardson, Pedro Domingos - MACHINE LEARNING , 2006
"... We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects in the ..."
Abstract - Cited by 816 (39 self) - Add to MetaCart
learned from relational databases by iteratively optimizing a pseudo-likelihood measure. Optionally, additional clauses are learned using inductive logic programming techniques. Experiments with a real-world database and knowledge base in a university domain illustrate the promise of this approach.

The use of the area under the ROC curve in the evaluation of machine learning algorithms

by Andrew P. Bradley - PATTERN RECOGNITION , 1997
"... In this paper we investigate the use of the area under the receiver operating characteristic (ROC) curve (AUC) as a performance measure for machine learning algorithms. As a case study we evaluate six machine learning algorithms (C4.5, Multiscale Classifier, Perceptron, Multi-layer Perceptron, k-Ne ..."
Abstract - Cited by 685 (3 self) - Add to MetaCart
In this paper we investigate the use of the area under the receiver operating characteristic (ROC) curve (AUC) as a performance measure for machine learning algorithms. As a case study we evaluate six machine learning algorithms (C4.5, Multiscale Classifier, Perceptron, Multi-layer Perceptron, k
Results 1 - 10 of 41,164