5100 search results - page 656 / 1020 » The Linear Complexity of a Graph |
171
click to vote
FLAIRS
2007
15 years 9 months ago
2007
Reasoning with hypothetical cases helps decision-makers evaluate alternate hypotheses for deciding a case. The hypotheticals demonstrate the sensitivity of a hypothesis to apparen...
191
Voted
BPM
2008
Springer
15 years 8 months ago
2008
Springer
We present a field study of oncology workflow, involving doctors, nurses and pharmacists at Danish hospitals and discuss the obstacles, enablers and challenges for the use of compu...
163
click to vote
FOGA
2007
15 years 8 months ago
2007
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes de�...
184
click to vote
FORTE
2007
15 years 8 months ago
2007
Abstract. We present and discuss a formal, high-level approach to the specification and composition of interaction protocols for service-oriented systems. This work is being develo...
178
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...