Results 1  10
of
218,600
Abstract Efficient Optimization Algorithms for Learning
, 2003
"... Many problems in machine learning and pattern recognition ultimately reduce to the optimization of a scalar valued function. A variety of general techniques exist for optimizing such objective functions. We study the general class of bound optimization algorithms – including ExpectationMaximizati ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Many problems in machine learning and pattern recognition ultimately reduce to the optimization of a scalar valued function. A variety of general techniques exist for optimizing such objective functions. We study the general class of bound optimization algorithms – including Expectation
An Efficient Optimization Algorithm for Structured Sparse CCA, with Applications to eQTL Mapping
"... Abstract In this paper we develop an efficient optimization algorithm for solving canonical correlation analysis (CCA) with complex structuredsparsityinducing penalties, including overlappinggrouplasso penalty and networkbased fusion penalty. We apply the proposed algorithm to an important geno ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract In this paper we develop an efficient optimization algorithm for solving canonical correlation analysis (CCA) with complex structuredsparsityinducing penalties, including overlappinggrouplasso penalty and networkbased fusion penalty. We apply the proposed algorithm to an important
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 718 (5 self)
 Add to MetaCart
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points
Optimal Aggregation Algorithms for Middleware
 IN PODS
, 2001
"... Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under ..."
Abstract

Cited by 717 (4 self)
 Add to MetaCart
must access every object in the database, to find its grade under each attribute. Fagin has given an algorithm (“Fagin’s Algorithm”, or FA) that is much more efficient. For some monotone aggregation functions, FA is optimal with high probability in the worst case. We analyze an elegant and remarkably
Efficient sparse coding algorithms
 In NIPS
, 2007
"... Sparse coding provides a class of algorithms for finding succinct representations of stimuli; given only unlabeled input data, it discovers basis functions that capture higherlevel features in the data. However, finding sparse codes remains a very difficult computational problem. In this paper, we ..."
Abstract

Cited by 445 (14 self)
 Add to MetaCart
present efficient sparse coding algorithms that are based on iteratively solving two convex optimization problems: an L1regularized least squares problem and an L2constrained least squares problem. We propose novel algorithms to solve both of these optimization problems. Our algorithms result in a
Pipeline Optimization for Asynchronous Circuits: Complexity Analysis and an Efficient Optimal Algorithm
 in Proc. International Conf. ComputerAided Design (ICCAD
, 2000
"... This paper addresses the problem of identifying the minimal pipelining needed in an asynchronous circuit (e.g., number/size of pipeline stages/latches required) to satisfy a given performance constraint, thereby implicitly minimizing area and power for a given performance. In contrast to the somewha ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
to the somewhat analogous problem of retiming in the synchronous domain, we first show that the basic pipeline optimization problem for asynchronous circuits is NPcomplete. This paper then presents an efficient branch and bound algorithm that can find the optimal pipeline configuration for moderately
Is LevenbergMarquardt the Most Efficient Optimization Algorithm for Implementing Bundle Adjustment?
, 2005
"... In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of featurebased structure and motion estimation algorithms. Bundle adjustment involves the formulation of a large scale, yet sparse minimization problem, which is traditionally ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of featurebased structure and motion estimation algorithms. Bundle adjustment involves the formulation of a large scale, yet sparse minimization problem, which is traditionally
Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
, 2000
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper present ..."
Abstract

Cited by 582 (53 self)
 Add to MetaCart
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract

Cited by 855 (68 self)
 Add to MetaCart
into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class
Implementing data cubes efficiently
 In SIGMOD
, 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract

Cited by 548 (1 self)
 Add to MetaCart
to materialize. The greedy algorithm performs within a small constant factor of optimal under a variety of models. We then consider the most common case of the hypercube lattice and examine the choice of materialized views for hypercubes in detail, giving some good tradeoffs between the space used
Results 1  10
of
218,600