Sciweavers

2252 search results - page 411 / 451
» Improving Random Forests
Sort
View
EMSOFT
2009
Springer
14 years 3 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
NOSSDAV
2009
Springer
14 years 3 months ago
Overlay monitoring and repair in swarm-based peer-to-peer streaming
In Swarm-based Peer-to-Peer Streaming (SPS) mechanisms, participating peers form a randomly connected mesh over which they incorporate swarm-like content delivery. In practice, a ...
Nazanin Magharei, Reza Rejaie
SAT
2009
Springer
113views Hardware» more  SAT 2009»
14 years 3 months ago
Exploiting Cycle Structures in Max-SAT
We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯l1 ∨ l2, ¯l1 ∨ l3, ¯l2 ∨ ¯l3) in the quality of the lower bound (LB) of modern MaxSAT ...
Chu Min Li, Felip Manyà, Nouredine Ould Moh...
AFRICACRYPT
2010
Springer
14 years 3 months ago
Flexible Group Key Exchange with On-demand Computation of Subgroup Keys
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communica...
Michel Abdalla, Céline Chevalier, Mark Manu...
ACSC
2008
IEEE
14 years 3 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen