3220 search results - page 477 / 644 » Constrained Graph Processes |
163
click to vote
AIEDAM
2007
15 years 6 months ago
2007
Because of the increasing complexity of products and the design process, as well as the popularity of computer-aided documentation tools, the number of electronic and textual desi...
154
click to vote
EJC
2007
15 years 6 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
168
click to vote
INTERNET
2007
15 years 6 months ago
2007
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
147
click to vote
CIKM
2009
Springer
16 years 29 days ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
182
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...