Sciweavers

1170 search results - page 78 / 234
» How Fast Is Too Fast
Sort
View
AI
1998
Springer
15 years 7 months ago
Temporally Invariant Junction Tree for Inference in Dynamic Bayesian Network
Abstract. Dynamic Bayesian networks (DBNs) extend Bayesian networks from static domains to dynamic domains. The only known generic method for exact inference in DBNs is based on dy...
Yang Xiang
FC
2010
Springer
188views Cryptology» more  FC 2010»
15 years 7 months ago
Building Incentives into Tor
Abstract. Distributed anonymous communication networks like Tor depend on volunteers to donate their resources. However, the efforts of Tor volunteers have not grown as fast as th...
Tsuen-Wan Ngan, Roger Dingledine, Dan S. Wallach
COCOA
2008
Springer
15 years 4 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
COLING
2008
15 years 4 months ago
Automatic Generation of Parallel Treebanks
The need for syntactically annotated data for use in natural language processing has increased dramatically in recent years. This is true especially for parallel treebanks, of whi...
Ventsislav Zhechev, Andy Way
FLAIRS
2003
15 years 4 months ago
An Improved Algorithm for Mining Association Rules Using Multiple Support Values
Almost all the approaches in association rule mining suggested the use of a single minimum support, technique that either rules out all infrequent itemsets or suffers from the bot...
Ioannis N. Kouris, Christos Makris, Athanasios K. ...