Results 1 - 10 of 5,986

The CLASSIC Project Co-ordinator:

by Olivier Pietquin, Helen Hastie, Srini Janarthanam, Simon Keizer, Ghislain Putois, Lonneke Van Der Plas, Olivier Pietquin, Helen Hastie, Srini Janarthanam, Ghislain Putois, Lonneke Van Der Plas , 2011
"... Research and Technological Development The deliverable identification sheet is to be found on the reverse of this page. Project ref. no. 216594 Project acronym ..."
Abstract - Add to MetaCart
Research and Technological Development The deliverable identification sheet is to be found on the reverse of this page. Project ref. no. 216594 Project acronym

Recognition-by-components: A theory of human image understanding

by Irving Biederman - Psychological Review , 1987
"... The perceptual recognition of objects is conceptualized to be a process in which the image of the input is segmented at regions of deep concavity into an arrangement of simple geometric components, such as blocks, cylinders, wedges, and cones. The fundamental assumption of the proposed theory, recog ..."
Abstract - Cited by 1272 (23 self) - Add to MetaCart
of these properties is generally invariant over viewing position and image quality and consequently allows robust object perception when the image is projected from a novel viewpoint or is degraded. RBC thus provides a principled account of the heretofore undecided relation between the classic principles

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

by Farid Alizadeh - SIAM Journal on Optimization , 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract - Cited by 547 (12 self) - Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized

MATRIX FACTORIZATION TECHNIQUES FOR RECOMMENDER SYSTEMS

by Yehuda Koren, Robert Bell, Chris Volinsky - IEEE COMPUTER , 2009
"... As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern co ..."
Abstract - Cited by 593 (4 self) - Add to MetaCart
As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern

Taverna: A tool for the composition and enactment of bioinformatics workflows

by Tom Oinn, Matthew Addis, Justin Ferris, Darren Marvin, Tim Carver, Matthew R. Pocock, Anil Wipat - Bioinformatics , 2004
"... *To whom correspondence should be addressed. Running head: Composing and enacting workflows using Taverna Motivation: In silico experiments in bioinformatics involve the co-ordinated use of computational tools and information repositories. A growing number of these resources are being made available ..."
Abstract - Cited by 465 (8 self) - Add to MetaCart
*To whom correspondence should be addressed. Running head: Composing and enacting workflows using Taverna Motivation: In silico experiments in bioinformatics involve the co-ordinated use of computational tools and information repositories. A growing number of these resources are being made

Locality Preserving Projection,"

by Xiaofei He , Partha Niyogi - Neural Information Processing System, , 2004
"... Abstract Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projective maps that arise by solving a variational problem that optimally preserves the neighborhood structure of the ..."
Abstract - Cited by 414 (16 self) - Add to MetaCart
of the data set. LPP should be seen as an alternative to Principal Component Analysis (PCA) -a classical linear technique that projects the data along the directions of maximal variance. When the high dimensional data lies on a low dimensional manifold embedded in the ambient space, the Locality Preserving

Representing Action and Change by Logic Programs

by Michael Gelfond, Vladimir Lifschitz - Journal of Logic Programming , 1993
"... We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a semantics ..."
Abstract - Cited by 414 (25 self) - Add to MetaCart
We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a

Principal Curves

by TREVOR HASTIE , WERNER STUETZLE , 1989
"... Principal curves are smooth one-dimensional curves that pass through the middle of a p-dimensional data set, providing a nonlinear summary of the data. They are nonparametric, and their shape is suggested by the data. The algorithm for constructing principal curve starts with some prior summary, suc ..."
Abstract - Cited by 394 (1 self) - Add to MetaCart
, such as the usual principal-component line. The curve in each successive iteration is a smooth or local average of the p-dimensional points, where the definition of local is based on the distance in arc length of the projections of the points onto the curve found in the previous iteration. In this article principal

On Projection Algorithms for Solving Convex Feasibility Problems

by Heinz H. Bauschke, Jonathan M. Borwein , 1996
"... Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of the ..."
Abstract - Cited by 331 (43 self) - Add to MetaCart
Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some

EXERCISES IN THE BIRATIONAL GEOMETRY OF ALGEBRAIC VARIETIES

by János Kollár , 2008
"... The book [KM98] gave an introduction to the birational geometry of algebraic varieties, as the subject stood in 1998. The developments of the last decade made the more advanced parts of Chapters 6 and 7 less important and the detailed treatment of surface singularities in Chapter 4 less necessary. H ..."
Abstract - Cited by 322 (1 self) - Add to MetaCart
smooth projective surfaces is a composite of blow-ups and blow-downs. Theorem 2. There are 3 species of “pure-bred ” surfaces: (Rational): For these surfaces the internal birational geometry is very complicated, but, up to birational equivalence, we have only P 2. These frequently appear in the classical
Results 1 - 10 of 5,986