Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 222,834,725 papers from all fields of science
Search
Sign In
Create Free Account
Hidden transformation
The hidden transformation reformulates a constraint satisfaction problem in such a way all constraints have at most two variables. The new problem is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Algorithm
Constraint satisfaction dual problem
Constraint satisfaction problem
Decomposition method (constraint satisfaction)
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
ShadowKey: A Practical Leakage Resilient Password System
Yingjiu Li
,
Qiang Yan
,
R. Deng
2015
Corpus ID: 60737811
The inherent tradeoff between security and usability in the design of leakage resilient password (LRP) systems reveals that a…
Expand
2013
2013
Learning in deep architectures with folding transformations
Lech Szymanski
,
B. McCane
IEEE International Joint Conference on Neural…
2013
Corpus ID: 17843953
We propose a folding transformation paradigm for supervised layer-wise learning in deep neural networks by introducing concepts…
Expand
2011
2011
Аномальные цервикальные мазки при неизмененной шейке матки: трудности скрининга, диагностики и лечения цервикальных интраэпителиальных неоплазий и микроинвазивного рака
Array И. Короленкова
2011
Corpus ID: 57788100
The author analyzes an algorithm for identifying and treating w omen with cervical intraepithelial neoplasias (CIN) and microinv…
Expand
2009
2009
Model Driven Engineering Languages and Systems, 12th International Conference, MODELS 2009, Denver, CO, USA, October 4-9, 2009. Proceedings
Andy Schürr
,
B. Selić
ACM/IEEE International Conference on Model Driven…
2009
Corpus ID: 7450428
Keynote 1.- Models. Models. Models. So What?.- (Meta-)Model Modeling and Management.- Modeling Modeling.- Representation and…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE