Results 1  10
of
2,974
Distance metric learning for large margin nearest neighbor classification
 In NIPS
, 2006
"... We show how to learn a Mahanalobis distance metric for knearest neighbor (kNN) classification by semidefinite programming. The metric is trained with the goal that the knearest neighbors always belong to the same class while examples from different classes are separated by a large margin. On seven ..."
Abstract

Cited by 695 (14 self)
 Add to MetaCart
We show how to learn a Mahanalobis distance metric for knearest neighbor (kNN) classification by semidefinite programming. The metric is trained with the goal that the knearest neighbors always belong to the same class while examples from different classes are separated by a large margin
Benchmarking Least Squares Support Vector Machine Classifiers
 NEURAL PROCESSING LETTERS
, 2001
"... In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set of eq ..."
Abstract

Cited by 476 (46 self)
 Add to MetaCart
In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set
Parameter Learning for Latent Network Diffusion
"... Diffusion processes in networks are increasingly used to model dynamic phenomena such as the spread of information, wildlife, or social influence. Our work addresses the problem of learning the underlying parameters that govern such a diffusion process by observing the time at which nodes become act ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
learning in such settings. Since both the E and M steps are computationally challenging, we employ a number of optimization methods such as nonlinear and differenceofconvex programming to address these challenges. Evaluation of the approach on the Redcockaded Woodpecker conservation problem shows
Tableau Algorithms for Description Logics
 STUDIA LOGICA
, 2000
"... Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Klone. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of descriptio ..."
Abstract

Cited by 260 (26 self)
 Add to MetaCart
. Nevertheless, due to different underlying intuitions and applications, most description logics differ significantly from runofthemill modal and program logics. Consequently, the research on tableau algorithms in description logics led to new techniques and results, which are, however, also of interest
AUGMENTED LAGRANGIANS AND APPLICATIONS OF THE PROXIMAL POINT ALGORITHM IN CONVEX PROGRAMMING
, 1976
"... The theory of the proximal point algorithm for maximal monotone operators is applied to three algorithms for solving convex programs, one of which has not previously been formulated. Rateofconvergence results for the "method of multipliers," of the strong sort already known, are derived ..."
Abstract

Cited by 207 (5 self)
 Add to MetaCart
The theory of the proximal point algorithm for maximal monotone operators is applied to three algorithms for solving convex programs, one of which has not previously been formulated. Rateofconvergence results for the "method of multipliers," of the strong sort already known, are derived
A HighPerformance Microarchitecture with HardwareProgrammable Functional Units
 In Proceedings of the 27th Annual International Symposium on Microarchitecture
, 1994
"... This paper explores a novel way to incorporate hardwareprogrammable resources into a processor microarchitecture to improve the performance of generalpurpose applications. Through a coupling of compiletime analysis routines and hardware synthesis tools, we automatically configure a given set of t ..."
Abstract

Cited by 221 (1 self)
 Add to MetaCart
functions. We briefly discuss the operating system and the programming language compilation techniques that are needed to successfully build PRISC and, we present performance results from a proofofconcept study. With the inclusion of a single 32bitwide PFU whose hardware cost is less than that of a 1
Objectoriented Bayesian networks.
 In Proc. UAI97,
, 1997
"... Abstract Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of mediumscale applications. However, when faced with a large complex domain, the task of modeling using Bayesian networks begins to re ..."
Abstract

Cited by 218 (9 self)
 Add to MetaCart
the attributes of an object. These attributes can themsel ves be objects, providing a natural framework for encoding partof hierarchies. Classes are used to pro vide a reusable probabilistic model which can be applied to multiple similar objects. Classes also support inher itance of model fragments from a class
Conflictdriven answer set solving
 in Proceedings IJCAI’07
, 2007
"... We introduce a new approach to computing answer sets of logic programs, based on concepts from constraint processing (CSP) and satisfiability checking (SAT). The idea is to view inferences in answer set programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraintbased ..."
Abstract

Cited by 201 (48 self)
 Add to MetaCart
constraintbased framework for the different kinds of inferences in ASP. It also allows us to apply advanced techniques from the areas of CSP and SAT. We have implemented our approach in the new ASP solver clasp. Our experiments show that the approach is competitive with stateoftheart ASP solvers. 1
A BRANCHANDCUT ALGORITHM FOR THE RESOLUTION OF LARGESCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS
, 1991
"... An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the in ..."
Abstract

Cited by 205 (7 self)
 Add to MetaCart
, as opposed to branchandbound, keeps on producing cuts after branching. The algorithm has been implemented in FORTRAN. Two different linear programming (LP) packages have been used as the LP solver. The implementation of the algorithm and the interface with one of the LP solvers is described in sufficient
Mariposa: A WideArea Distributed Database System
 VLDB Journal
, 1996
"... Abstract. The requirements of widearea distributed database systems differ dramatically from those of localarea network systems. In a widearea network (WAN) configuration, individual sites usually report to different system administrators, have different access and charging algorithms, install si ..."
Abstract

Cited by 198 (8 self)
 Add to MetaCart
in a WAN distributed DBMS. In this world, a single program performing global query optimization using a costbased optimizer will not work well. Costbased optimization does not respond well to sitespecific type extension, access constraints, charging algorithms, and timeofday constraints
Results 1  10
of
2,974