Sciweavers

4007 search results - page 381 / 802
» Computation with imprecise probabilities
Sort
View
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
JALC
2006
61views more  JALC 2006»
15 years 6 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
Mathieu Baudet
NCA
2006
IEEE
15 years 6 months ago
Open-loop regulation and tracking control based on a genealogical decision tree
The goal of this paper is to design a new control algorithm for open-loop control of complex systems. This control approach is based on a genealogical decision tree for both regula...
Kaddour Najim, Enso Ikonen, P. Del Moral
CGF
2002
129views more  CGF 2002»
15 years 6 months ago
Efficient Multidimensional Sampling
Image synthesis often requires the Monte Carlo estimation of integrals. Based on a generalized concept of stratification we present an efficient sampling scheme that consistently ...
Thomas Kollig, Alexander Keller
COLING
2002
15 years 6 months ago
A Probabilistic Method for Analyzing Japanese Anaphora Integrating Zero Pronoun Detection and Resolution
This paper proposes a method to analyze Japanese anaphora, in which zero pronouns (omitted obligatory cases) are used to refer to preceding entities (antecedents). Unlike the case...
Kazuhiro Seki, Atsushi Fujii, Tetsuya Ishikawa