Sciweavers

172 search results - page 10 / 35
» Separation of Nonconvex Sets with General Augmenting Functio...
Sort
View
PLDI
2010
ACM
14 years 18 days ago
Mint: Java multi-stage programming using weak separability
Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the ov...
Edwin Westbrook, Mathias Ricken, Jun Inoue, Yilong...
TPDS
1998
122views more  TPDS 1998»
13 years 7 months ago
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
Isidore Rigoutsos, Alex Delis
MP
2010
172views more  MP 2010»
13 years 6 months ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang
MICCAI
2008
Springer
14 years 8 months ago
A Variational Level Set Approach to Segmentation and Bias Correction of Images with Intensity Inhomogeneity
Abstract. This paper presents a variational level set approach to joint segmentation and bias correction of images with intensity inhomogeneity. Our method is based on an observati...
Chunming Li, Rui Huang, Zhaohua Ding, Chris Gat...
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 7 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle