1920 search results - page 99 / 384 » The Complexity of the A B C Problem |
162
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper addresses the problem of font retrieval using a query-by-example paradigm: given a font, retrieve the the most visually similar fonts. We describe a font by (a) renderi...
146
click to vote
TIT
1998
15 years 5 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
168
click to vote
SIAMCO
2010
15 years 29 days ago
2010
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
193
click to vote
ATAL
2010
Springer
15 years 7 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...
143
click to vote
AAMAS
2005
Springer
15 years 11 months ago
2005
Springer
This research aims at studying the effects of exchanging information during the learning process in Multiagent Systems. The concept of advice-exchange, introduced in (Nunes and Ol...