Sciweavers

1352 search results - page 208 / 271
» An algorithm for minimizing the Mumford-Shah functional
Sort
View
MP
2002
176views more  MP 2002»
13 years 8 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 7 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
SAC
2003
ACM
14 years 2 months ago
A Markov Random Field Model of Microarray Gridding
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to auto...
Mathias Katzer, Franz Kummert, Gerhard Sagerer
INFOCOM
2002
IEEE
14 years 2 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
CVPR
2004
IEEE
14 years 11 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov