Sciweavers

611 search results - page 32 / 123
» The Cardinality Matrix Constraint
Sort
View
CADE
2010
Springer
14 years 10 months ago
MUNCH - Automated Reasoner for Sets and Multisets
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
Ruzica Piskac, Viktor Kuncak
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 2 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
ANOR
2011
117views more  ANOR 2011»
14 years 1 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 3 days 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
MVA
2007
154views Computer Vision» more  MVA 2007»
14 years 11 months ago
Fisher Non-negative Matrix Factorization with Pairwise Weighting
Non-negative matrix factorization (NMF) is a powerful feature extraction method for finding parts-based, linear representations of non-negative data . Inherently, it is unsupervis...
Xi Li, Kazuhiro Fukui