Sciweavers

4313 search results - page 88 / 863
» Using time travel to diagnose computer problems
Sort
View
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
16 years 7 days ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang
PDPTA
2000
15 years 8 months ago
Parallel Real-Time Cryptography: Beyond Speedup II
The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. However, it was shown recently that a second eq...
Selim G. Akl, Stefan D. Bruda
IWPEC
2009
Springer
16 years 1 months ago
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
Henning Fernau, Joachim Kneis, Dieter Kratsch, Ale...
IPTPS
2004
Springer
16 years 4 days ago
Friends Troubleshooting Network: Towards Privacy-Preserving, Automatic Troubleshooting
Abstract— Content sharing is a popular usage of peerto-peer systems for its inherent scalability and low cost of maintenance. In this paper, we leverage this nature of peer-to-pe...
Helen J. Wang, Yih-Chun Hu, Chun Yuan, Zheng Zhang...
ACL
2000
15 years 8 months ago
A Polynomial-Time Fragment of Dominance Constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
Alexander Koller, Kurt Mehlhorn, Joachim Niehren