Sciweavers

3946 search results - page 4 / 790
» The computational complexity of choice sets
Sort
View
CCA
2009
Springer
13 years 11 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
ECCC
2008
108views more  ECCC 2008»
13 years 7 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
GI
2007
Springer
14 years 1 months ago
Multisensor Based Generation of Templates for Object Tracking in Complex Scenarios
Abstract: Protection and surveillance of persons and facilities is frequently associated with automatic tracking of striking objects like vehicles or persons in an image sequence. ...
Carmen Witte, Klaus Jäger, Walter Armbruster,...
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 4 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...