Sciweavers

685 search results - page 51 / 137
» Succinct Trees in Practice
Sort
View
JMS
2010
65views more  JMS 2010»
13 years 6 months ago
A Tree-Based Decision Model to Support Prediction of the Severity of Asthma Exacerbations in Children
This paper describes the development of a tree-based decision model to predict the severity of pediatric asthma exacerbations in the emergency department (ED) at two hours followi...
Ken Farion, Wojtek Michalowski, Szymon Wilk, Dympn...
ICDCS
2008
IEEE
14 years 2 months ago
Distributed Divide-and-Conquer Techniques for Effective DDoS Attack Defenses
Distributed Denial-of-Service (DDoS) attacks have emerged as a popular means of causing mass targeted service disruptions, often for extended periods of time. The relative ease an...
Muthusrinivasan Muthuprasanna, Govindarasu Manimar...
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 1 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
ICML
2006
IEEE
14 years 8 months ago
Fast particle smoothing: if I had a million particles
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...
Mike Klaas, Mark Briers, Nando de Freitas, Arnaud ...
CG
2008
Springer
13 years 9 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003