Sciweavers

2056 search results - page 102 / 412
» time 2000
Sort
View
CAISE
2000
Springer
15 years 8 months ago
Efficient Distributed Workflow Management Based on Variable Server Assignments
For enterprise-wide and cross-enterprise workflow (WF) applications, the load of the WF servers and the amount of communication in the subnets may become a bottleneck. This paper s...
Thomas Bauer, Peter Dadam
ECAI
2000
Springer
15 years 8 months ago
Plan Recognition through Goal Graph Analysis
We present a novel approach to plan recognition based on a two-stage paradigm of graph construction and analysis. First, a graph structure called a Goal Graph is constructed to rep...
Jun Hong
ALGORITHMICA
2000
85views more  ALGORITHMICA 2000»
15 years 4 months ago
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
Sanjiv Kapoor, H. Ramesh
ICML
2000
IEEE
16 years 5 months ago
Complete Cross-Validation for Nearest Neighbor Classifiers
Cross-validation is an established technique for estimating the accuracy of a classifier and is normally performed either using a number of random test/train partitions of the dat...
Matthew D. Mullin, Rahul Sukthankar
WSC
2000
15 years 5 months ago
Partitioning parallel simulation of wireless networks
In this paper, we present a simulation testbed for wireless and mobile telecommunication systems, a two-stage PCS parallel simulation testbed which makes use of a conservative sch...
Azzedine Boukerche, Alessandro Fabbri