1569 search results - page 304 / 314 » On the Locality of Representations |
149
click to vote
AAAI
1994
15 years 3 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
137
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 3 months ago
2010
Eurographics
We introduce the notion of consensus skeletons for non-rigid space-time registration of a deforming shape. Instead of basing the registration on point features, which are local an...
145
click to vote
ATAL
2010
Springer
15 years 3 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...
112
click to vote
CONEXT
2009
ACM
15 years 3 months ago
2009
ACM
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
137
click to vote
MM
2010
ACM
15 years 2 months ago
2010
ACM
This paper presents a supervised manifold learning model for dimensionality reduction in image and video classification tasks. Unlike most manifold learning models that emphasize ...