11151 search results - page 286 / 2231 » On the Complexity of Model Expansion |
195
click to vote
GD
1995
Springer
15 years 11 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
195
click to vote
BNCOD
2003
15 years 8 months ago
2003
In this paper we describe a query paradigm based on ontologies, aggregate table-driven querying and expansion of QBE. It has two novel features: visually specifying aggregate table...
188
click to vote
CVIU
2008
15 years 7 months ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
211
click to vote
MAM
2002
15 years 7 months ago
2002
DSP software development has been tied down by extreme computational requirements. Furthermore, the DSP development tools available today are less advanced than in other embedded ...
168
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....