Sciweavers

15485 search results - page 210 / 3097
» Computing Optimal Subsets
Sort
View
INFORMATICALT
2000
96views more  INFORMATICALT 2000»
15 years 6 months ago
Computing True Shadow Prices in Linear Programming
It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. How...
James K. Ho
ICPR
2006
IEEE
16 years 7 months ago
Clustering-based multispectral band selection using mutual information
This work presents the application of a novel technique on dimensionality reduction to deal with multispectral images. A distance based on mutual information is used to construct ...
Adolfo Martínez Usó, Filiberto Pla, ...
174
Voted
FOCS
2009
IEEE
16 years 1 months ago
Two-Message Quantum Interactive Proofs Are in PSPACE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
Rahul Jain, Sarvagya Upadhyay, John Watrous
FOCS
1999
IEEE
15 years 10 months ago
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice
Christian Borgs, Jennifer T. Chayes, Alan M. Friez...
IPPS
1998
IEEE
15 years 10 months ago
Solving the Maximum Clique Problem Using PUBB
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuich...