2911 search results - page 492 / 583 » A Logic of Graph Constraints |
172
click to vote
SIGCOMM
2010
ACM
15 years 6 months ago
2010
ACM
Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address...
208
click to vote
FPGA
2010
ACM
15 years 6 months ago
2010
ACM
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
154
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 ...
170
click to vote
JCSS
2000
15 years 6 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
193
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
We present Propagation Networks (P-Nets), a novel approach for representing and recognizing sequential activities that include parallel streams of action. We represent each activi...