Sciweavers

4047 search results - page 538 / 810
» The Discrete Basis Problem
Sort
View
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 7 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
PODS
2006
ACM
137views Database» more  PODS 2006»
16 years 5 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
CPAIOR
2009
Springer
15 years 11 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
NIPS
2003
15 years 6 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
APPML
2007
154views more  APPML 2007»
15 years 5 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio