Results 1  10
of
1,311,787
Probability Matching Priors for Nonregular Cases
"... this paper, we consider the approach of matching. The notion of matching, which first appeared in Welch & Peers (1963), may be thought of as an attempt of reconciliation of the two different schools (Peers, 1965), or as a validation of a noninformative prior (Berger & Bernardo, 1989; Datta, ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
regulartype parameters are also present. In this paper, we consider the approach of matching for both oneparameter and multiparameter cases and compare with the corresponding reference priors. We observe niceties such as the reference prior is, most often, also probability matching. To find out
Asymptotic concentration probabilities of the Pitman estimator and weighted estimators in the nonregular case
"... For a family of truncated distributions with a location parameter, the asymptotic expansion of the Pitman estimator and its asymptotic variance are given by Akahira, Ohyauchi and Takeuchi (2007). In this article, the asymptotic distributions of the Pitman estimator and weighted estimators are deriv ..."
Abstract
 Add to MetaCart
For a family of truncated distributions with a location parameter, the asymptotic expansion of the Pitman estimator and its asymptotic variance are given by Akahira, Ohyauchi and Takeuchi (2007). In this article, the asymptotic distributions of the Pitman estimator and weighted estimators are derived, and their asymptotic concentration probabilities are also computed. Further the asymptotic comparison of their estimators for some truncated distributions is discussed.
Semiparametric Gaussian white noise models in the nonregular case
, 2007
"... This paper deals with the behavior of some nonlinear semiparametric models in the case where the unknown nuisance function f is not necessarily differentiable. Two models are considered, in the Gaussian white noise framework: estimation of the center of symmetry and estimation of the period of a per ..."
Abstract
 Add to MetaCart
of convergence are obtained. We also prove a lower bound result which implies that these semiparametric rates are strictly below the parametric ones, meaning there is a significant loss of information, contrary to the regular case.
ASYMPTOTIC THEORY FOR ESTIMATION OF LOCATION IN NONREGULAR CASES, I: ORDER OF CONVERGENCE OF CONSISTENT ESTIMATORS*
"... journal or publication title Reports of statistical application research, Union of Japanese Scientists and Engineers volume 22 number 1 page range 826 year 1975 ..."
Abstract
 Add to MetaCart
journal or publication title Reports of statistical application research, Union of Japanese Scientists and Engineers volume 22 number 1 page range 826 year 1975
A case study of open source software development: the Apache server
 In: Proceedings of the 22nd International Conference on Software Engineering (ICSE 2000
, 2000
"... According to its proponents, open source style software development has the capacity to compete successfully, and perhaps in many cases displace, traditional commercial development methods. In order to begin investigating such claims, we examine the development process of a major open source applica ..."
Abstract

Cited by 787 (31 self)
 Add to MetaCart
According to its proponents, open source style software development has the capacity to compete successfully, and perhaps in many cases displace, traditional commercial development methods. In order to begin investigating such claims, we examine the development process of a major open source
Pegasos: Primal Estimated subgradient solver for SVM
"... We describe and analyze a simple and effective stochastic subgradient descent algorithm for solving the optimization problem cast by Support Vector Machines (SVM). We prove that the number of iterations required to obtain a solution of accuracy ɛ is Õ(1/ɛ), where each iteration operates on a singl ..."
Abstract

Cited by 531 (21 self)
 Add to MetaCart
single training example. In contrast, previous analyses of stochastic gradient descent methods for SVMs require Ω(1/ɛ2) iterations. As in previously devised SVM solvers, the number of iterations also scales linearly with 1/λ, where λ is the regularization parameter of SVM. For a linear kernel, the total
NonRegular Process Types
 Proceedings of the 5th European Conference on Parallel Processing (EuroPar’99), number 1685 in LNCS
, 1999
"... . Process types specify sequences of acceptable messages. Even if the set of acceptable messages changes dynamically, a type checker can statically ensure that only acceptable messages are sent. As proposed so far, all message sequence sets specified by types can be generated by regular grammars. We ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. We propose to increase the expressiveness so that nonregular message sequence sets can be specified. Type equivalence and subtyping take possible type extensions into account. Keywords: type systems, subtyping, active objects 1 Introduction A process type [1315] specifies not only a set
Verification of NonRegular Properties
"... We present a gamebased formalism that can be used to do local model checking for FLC, a modal fixed point logic that extends the calculus with a sequential composition operator. This logic is capable of expressing nonregular properties which are interesting for verification purposes. 1. ..."
Abstract
 Add to MetaCart
We present a gamebased formalism that can be used to do local model checking for FLC, a modal fixed point logic that extends the calculus with a sequential composition operator. This logic is capable of expressing nonregular properties which are interesting for verification purposes. 1.
A Guided Tour to Approximate String Matching
 ACM COMPUTING SURVEYS
, 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract

Cited by 584 (38 self)
 Add to MetaCart
the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to compare the performance of the different algorithms and show which are the best choices according to each case
ChernSimons Gauge Theory as a String Theory
, 2003
"... Certain two dimensional topological field theories can be interpreted as string theory backgrounds in which the usual decoupling of ghosts and matter does not hold. Like ordinary string models, these can sometimes be given spacetime interpretations. For instance, threedimensional ChernSimons gaug ..."
Abstract

Cited by 551 (14 self)
 Add to MetaCart
Simons gauge theory can arise as a string theory. The worldsheet model in this case involves a topological sigma model. Instanton contributions to the sigma model give rise to Wilson line insertions in the spacetime ChernSimons theory. A certain holomorphic analog of ChernSimons theory can also arise as a
Results 1  10
of
1,311,787