Sciweavers

1414 search results - page 42 / 283
» Randomness and Universal Machines
Sort
View
INFORMATIKTAGE
2008
13 years 10 months ago
Practical Secure Function Evaluation
: This thesis focuses on the practical aspects of general two-party Secure Function Evaluation (SFE). A new SFE protocol that allows free evaluation of XOR gates and is provably se...
Thomas Schneider 0003
ECML
2004
Springer
14 years 2 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
MIXER
2004
13 years 10 months ago
FixIt: An Approach towards Assisting Workers in Diagnosing Machine Malfunctions
Augmented Reality (AR) is a newly emerging user interface paradigm that is currently under rapid development. AR is still in its infancy. Only very few cases exist, in which AR te...
Gudrun Klinker, Hesam Najafi, Tobias Sielhorst, Fa...
FPL
1994
Springer
435views Hardware» more  FPL 1994»
14 years 23 days ago
Data-Procedural Languages for FPL-based Machines
This paper introduces a new high level programming language for a novel class of computational devices namely data-procedural machines. These machines are by up to several orders o...
Andreas Ast, Jürgen Becker, Reiner W. Hartens...
GI
2004
Springer
14 years 2 months ago
Outlier Detection by Rareness Assumption
: A concept for identification of candidates for outliers is presented, with a focus on nominal variables. The database concerned is searched for rules that are almost universally...
Tomas Hrycej, Jochen Hipp