Sciweavers

989 search results - page 73 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...
CP
2000
Springer
14 years 8 days ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
ICCVW
1999
Springer
14 years 6 days ago
Optimization Criteria, Sensitivity and Robustness of Motion and Structure Estimation
The prevailing efforts to study the standard formulation of motion and structure recovery have been recently focused on issues of sensitivity and and robustness of existing techn...
Jana Kosecka, Yi Ma, Shankar Sastry
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 6 months ago
Mechanism Design via Correlation Gap
For revenue and welfare maximization in singledimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple i...
Qiqi Yan
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
14 years 8 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar