1477 search results - page 199 / 296 » Complexity of (iterated) dominance |
127
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
113
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
86
Voted
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
Inspired by tensor voting, we present luminance voting, a novel approach for image registration with global and local luminance alignment. The key to our modeless approach is the ...
102
click to vote
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper discusses building complex classifiers from a single labeled example and vast number of unlabeled observation sets, each derived from observation of a single process or...
112
Voted
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
The objective of active recognition is to iteratively collect the next "best" measurements (e.g., camera angles or viewpoints), to maximally reduce ambiguities in recogn...