Sciweavers

195 search results - page 27 / 39
» E-voting - a Key to Independence for All
Sort
View
125
Voted
ICDCS
1990
IEEE
15 years 6 months ago
Implementing Fault-Tolerant Distributed Applications
This paper develops some control structures suitable for composing fault-tolerant distrib uted applications using atomic actions (atomic transactions) as building blocks, and then...
Santosh K. Shrivastava, Stuart M. Wheater
NIPS
2001
15 years 3 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
ENTCS
2007
95views more  ENTCS 2007»
15 years 1 months ago
Hybridizing a Logical Framework
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
Jason Reed
102
Voted
ICIC
2009
Springer
14 years 11 months ago
Towards a Better Understanding of Random Forests through the Study of Strength and Correlation
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...
Simon Bernard, Laurent Heutte, Sébastien Ad...
157
Voted
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
15 years 11 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon