Sciweavers

Share
1249 search results - page 250 / 250
» Graph Theory
Sort
View
EJC
2016
4 years 3 months ago
A new line of attack on the dichotomy conjecture
The well known dichotomy conjecture of Feder and Vardi states that for every family Γ of constraints CSP(Γ) is either polynomially solvable or NP-hard. Bulatov and Jeavons reform...
Gábor Kun, Mario Szegedy
TMM
2016
56views more  TMM 2016»
4 years 3 months ago
Multi-Perspective Cost-Sensitive Context-Aware Multi-Instance Sparse Coding and Its Application to Sensitive Video Recognition
—With the development of video-sharing websites, P2P, micro-blog, mobile WAP websites, and so on, sensitive videos can be more easily accessed. Effective sensitive video recognit...
Weiming Hu, Xinmiao Ding, Bing Li, Jianchao Wang, ...
MODELS
2015
Springer
4 years 3 months ago
Multi-Language Modelling with Second Order Intensions
Abstract. In the last decade, there have been several fundamental advances in the field of ontological and linguistic metamodelling. They the use of megamodels to link abstract, d...
Vadim Zaytsev
DIMACS
1996
9 years 8 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
books