3946 search results - page 100 / 790 » The computational complexity of choice sets |
143
click to vote
JELIA
2004
Springer
15 years 11 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
196
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
In this paper, we present a vision system for object recognition in aerial images, which enables broader mission profiles for Micro Air Vehicles (MAVs). The most important factors ...
153
click to vote
CHI
2004
ACM
16 years 6 months ago
2004
ACM
Sensing affect raises critical privacy concerns, which are examined here using ethical theory, and with a study that illuminates the connection between ethical theory and privacy....
138
click to vote
STACS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
181
click to vote
ICMLA
2004
15 years 7 months ago
2004
Complexity, or in other words compactness, of models generated by rule learners is one of often neglected issues, although it has a profound effect on the success of any project t...