1135 search results - page 31 / 227 » Interactive Problem Solving via Algorithm Visualization |
278
click to vote
SIAMIS
2010
15 years 22 days ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
137
click to vote
IJCAI
1989
15 years 7 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
144
click to vote
CHI
2003
ACM
16 years 6 months ago
2003
ACM
We conducted an empirical study to better understand collaborative information visualization. We found that a system that offered fewer options for visualizations yielded more cor...
167
click to vote
FMCAD
2007
Springer
16 years 5 days ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
160
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...