Sciweavers

2252 search results - page 341 / 451
» Improving Random Forests
Sort
View
RTAS
2005
IEEE
14 years 4 months ago
A Real-Time Performance Comparison of Distributable Threads and Event Channels
No one middleware communication model completely solves the problem of ensuring schedulability in every DRE system. Furthermore, there have been few studies to date of the trade-o...
Yuanfang Zhang, Bryan Thrall, Stephen Torri, Chris...
PEWASUN
2005
ACM
14 years 4 months ago
Impact of mobility prediction on the temporal stability of MANET clustering algorithms
Scalability issues for routing in mobile ad hoc networks (MANETs) have been typically addressed using hybrid routing schemes operating in a hierarchical network architecture. Seve...
Aravindhan Venkateswaran, Venkatesh Sarangan, Nata...
SPAA
2005
ACM
14 years 4 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
WOSP
2005
ACM
14 years 4 months ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
14 years 4 months ago
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
Ronald Cramer, Serge Fehr, Martijn Stam