Sciweavers

73 search results - page 11 / 15
» A Landscape Analysis of Constraint Satisfaction Problems
Sort
View
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
15 years 10 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
STDBM
2004
Springer
171views Database» more  STDBM 2004»
15 years 3 months ago
Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets
With the recent progress of spatial information technologies and mobile computing technologies, spatio-temporal databases which store information on moving objects including vehicl...
Yoshiharu Ishikawa, Yuichi Tsukamoto, Hiroyuki Kit...
BMVC
2002
15 years 5 days ago
A Qualitative, Multi-scale Grammar For Image Description and Analysis
A qualitative image description grammar with automatic image fitting and object modelling algorithms is presented. The grammar is based on assigning a square sub-region of an imag...
Derek R. Magee
CP
2006
Springer
15 years 1 months ago
Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
Cédric Pralet, Thomas Schiex, Gérard...
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
15 years 4 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák