搜索结果: 1-3 共查到“计算机科学技术 connection”相关记录3条 . 查询时间(0.091 秒)
The Set Constraint/CFL Reachability Connection in Practice
Set constraints context-free language reachability flow analysis type qualifiers
font style='font-size:12px;'>
2016/5/24
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new reduction from Dyck-CFL r...
The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem
Markov process fast mixing second smallest eigenvalue semidefinite programming dimensionality reduction
font style='font-size:12px;'>
2015/8/10
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution ...
Realist and Postmodernist Perspectives on Information Systems Research: points of connection
Research methodology critical realism postmodernism information systems
font style='font-size:12px;'>
2009/12/8
There has been considerable debate in the information systems (IS) literature as to which research methodology is most appropriate to address IS related problems. This paper contributes to that debate...