694 search results - page 119 / 139 » Open Graphs and Computational Reasoning |
FUIN
2010
14 years 10 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
109
click to vote
SMA
2008
ACM
14 years 10 months ago
2008
ACM
View identification is the basal process for solid reconstruction from engineering drawings. A new method is presented to label various views from a section-involved drawing and i...
MFCS
2010
Springer
14 years 10 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
111
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Reconstructing transparent objects is a challenging problem. While producing reasonable results for quite complex objects, existing approaches require custom calibration or somewh...
107
click to vote
SADM
2011
14 years 6 months ago
2011
Abstract: Visualizing data by graphing a response against certain factors, and conditioning on other factors, has arisen independently in many contexts. One is the interaction plot...