Sciweavers

CVPR
2011
IEEE
12 years 8 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
TNN
2010
148views Management» more  TNN 2010»
12 years 11 months ago
Generalized low-rank approximations of matrices revisited
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
Jun Liu, Songcan Chen, Zhi-Hua Zhou, Xiaoyang Tan
TNN
2010
234views Management» more  TNN 2010»
12 years 11 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
TIP
2010
97views more  TIP 2010»
12 years 11 months ago
Image Clustering Using Local Discriminant Models and Global Integration
In this paper, we propose a new image clustering algorithm, referred to as Clustering using Local Discriminant Models and Global Integration (LDMGI). To deal with the data points s...
Yi Yang, Dong Xu, Feiping Nie, Shuicheng Yan, Yuet...
SIAMJO
2010
47views more  SIAMJO 2010»
12 years 11 months ago
Integer Programming Subject to Monomial Constraints
Abstract. We investigate integer programs containing monomial constraints of the type Q iI xi i = b. Due to the number-theoretic nature of these constraints, standard methods based...
Christoph Buchheim, Dennis Michaels, Robert Weisma...
TVCG
2011
108views more  TVCG 2011»
12 years 11 months ago
Creature Control in a Fluid Environment
—In this paper, we propose a method designed to allow creatures to actively respond to a fluid environment. We explore various objective functions in order to determine ways to ...
Michael Lentine, Jon Gretarsson, Craig A. Schroede...
SIAMIS
2011
12 years 11 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
JORS
2011
67views more  JORS 2011»
12 years 11 months ago
Robust parameter design optimization of simulation experiments using stochastic perturbation methods
Stochastic perturbation methods can be applied to problems for which either the objective function is represented analytically, or the objective function is the result of a simula...
A. K. Miranda, E. Del Castillo
IOR
2011
152views more  IOR 2011»
12 years 11 months ago
Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition
We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as ...
Naomi Miller, Andrzej Ruszczynski
EVOW
2009
Springer
13 years 2 months ago
Evolutionary Approaches for Strain Optimization Using Dynamic Models under a Metabolic Engineering Perspective
One of the purposes of Systems Biology is the quantitative modeling of biochemical networks. In this effort, the use of dynamical mathematical models provides for powerful tools in...
Pedro Evangelista, Isabel Rocha, Eugénio C....