Results 11  20
of
6,727
Blobworld: A System for RegionBased Image Indexing and Retrieval
 In Third International Conference on Visual Information Systems
, 1999
"... . Blobworld is a system for image retrieval based on finding coherent image regions which roughly correspond to objects. Each image is automatically segmented into regions ("blobs") with associated color and texture descriptors. Querying is based on the attributes of one or two regions of ..."
Abstract

Cited by 375 (4 self)
 Add to MetaCart
of interest, rather than a description of the entire image. In order to make largescale retrieval feasible, we index the blob descriptions using a tree. Because indexing in the highdimensional feature space is computationally prohibitive, we use a lowerrank approximation to the highdimensional distance
On the capacity of MIMO broadcast channel with partial side information
 IEEE TRANS. INFORM. THEORY
, 2005
"... In multipleantenna broadcast channels, unlike pointtopoint multipleantenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with transmit antennas and singleantenna users, the ..."
Abstract

Cited by 349 (9 self)
 Add to MetaCart
In multipleantenna broadcast channels, unlike pointtopoint multipleantenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with transmit antennas and singleantenna users
REGIONS OF FEASIBLE POINTTOPOINT TRAJECTORIES IN THE CARTESIAN WORKSPACE OF FULLYPARALLEL MANIPULATORS
"... The goal of this paper is to define the nconnected regions in the Cartesian workspace of fullyparallel manipulators, i.e. the maximal regions where it is possible to execute pointtopoint motions. The manipulators considered in this study may have multiple direct and inverse kinematic solutions. T ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The goal of this paper is to define the nconnected regions in the Cartesian workspace of fullyparallel manipulators, i.e. the maximal regions where it is possible to execute pointtopoint motions. The manipulators considered in this study may have multiple direct and inverse kinematic solutions
An Improved Training Algorithm for Support Vector Machines
, 1997
"... We investigate the problem of training a Support Vector Machine (SVM) [1, 2, 7] on a very large date base (e.g. 50,000 data points) in the case in which the number of support vectors is also very large (e.g. 40,000). Training a SVM is equivalent to solving a linearly constrained quadratic programmin ..."
Abstract

Cited by 339 (1 self)
 Add to MetaCart
We investigate the problem of training a Support Vector Machine (SVM) [1, 2, 7] on a very large date base (e.g. 50,000 data points) in the case in which the number of support vectors is also very large (e.g. 40,000). Training a SVM is equivalent to solving a linearly constrained quadratic
On the Implementation of an InteriorPoint Filter LineSearch Algorithm for LargeScale Nonlinear Programming
, 2004
"... We present a primaldual interiorpoint algorithm with a filter linesearch method for nonlinear programming. Local and global convergence properties of this method were analyzed in previous work. Here we provide a comprehensive description of the algorithm, including the feasibility restoration ph ..."
Abstract

Cited by 294 (6 self)
 Add to MetaCart
We present a primaldual interiorpoint algorithm with a filter linesearch method for nonlinear programming. Local and global convergence properties of this method were analyzed in previous work. Here we provide a comprehensive description of the algorithm, including the feasibility restoration
Stochastic global optimization
, 2008
"... Stochastic global optimization methods are methods for solving a global optimization problem incorporating probabilistic (stochastic) elements, either in the problem data (the objective function, the constraints, etc.), or in the algorithm itself, or in both. Global optimization is a very important ..."
Abstract

Cited by 289 (6 self)
 Add to MetaCart
much easier and more efficiently than the deterministic algorithms. The problem of global minimization. Consider a general minimization problem f(x)→minx∈X with objective function f(·) and feasible region X. Let x ∗ be a global minimizer of f(·); that is, x ∗ is a point in X such that f(x∗) = f
Fast Contact Force Computation for Nonpenetrating Rigid Bodies
, 1994
"... A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In contrast to previous approaches, the problem of computing contact forces is not transformed into an optimization problem. B ..."
Abstract

Cited by 278 (7 self)
 Add to MetaCart
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In contrast to previous approaches, the problem of computing contact forces is not transformed into an optimization problem
Mathematical Programming manuscript No.(will be inserted by the editor) R. Baker Kearfott Improved and Simplified Validation of Feasible Points Inequality and Equality Constrained Problems Received: date / Revised version: date
"... Abstract. In validated branch and bound algorithms for global optimization, upper bounds on the global optimum are obtained by evaluating the objective at an approximate optimizer; the upper bounds are then used to eliminate subregions of the search space. For constrained optimization, in general, a ..."
Abstract
 Add to MetaCart
, a small region must be constructed within which existence of a feasible point can be proven, and an upper bound on the objective over that region is obtained. We had previously proposed a perturbation technique for constructing such a region. In this work, we propose a much simplified and improved
PrimalDual InteriorPoint Methods for SelfScaled Cones
 SIAM Journal on Optimization
, 1995
"... In this paper we continue the development of a theoretical foundation for efficient primaldual interiorpoint algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are selfscaled (see [9]). The class of problems under consideration includes li ..."
Abstract

Cited by 206 (12 self)
 Add to MetaCart
In this paper we continue the development of a theoretical foundation for efficient primaldual interiorpoint algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are selfscaled (see [9]). The class of problems under consideration includes
The Feasibility of Supporting LargeScale Live Streaming Applications with Dynamic Application EndPoints
 In Proceedings of ACM SIGCOMM
, 2004
"... While application endpoint architectures have proven to be viable solutions for largescale distributed applications such as distributed computing and filesharing, there is little known about its feasibility for more bandwidthdemanding applications such as live streaming. Heterogeneity in bandwid ..."
Abstract

Cited by 149 (4 self)
 Add to MetaCart
While application endpoint architectures have proven to be viable solutions for largescale distributed applications such as distributed computing and filesharing, there is little known about its feasibility for more bandwidthdemanding applications such as live streaming. Heterogeneity
Results 11  20
of
6,727