Results 1  10
of
9,490
A Modified Version
 of the Lewellen and Badrinath Measure of Tobin’s Q, Financial Management
, 1999
"... Bandwagon, underdog, and political competition: The unidimensional case by ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Bandwagon, underdog, and political competition: The unidimensional case by
Inverted Index based Modified Version of
"... Abstract: This research proposes a new strategy where documents are encoded into string vectors and modified version of KNN to be adaptable to string vectors for text categorization. Traditionally, when KNN are used for pattern classification, raw data should be encoded into numerical vectors. This ..."
Abstract
 Add to MetaCart
Abstract: This research proposes a new strategy where documents are encoded into string vectors and modified version of KNN to be adaptable to string vectors for text categorization. Traditionally, when KNN are used for pattern classification, raw data should be encoded into numerical vectors
TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems
 IN PROCEEDINGS OF THE 1994 WINTER USENIX CONFERENCE
, 1994
"... TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation5000/240's that are connected by a 100Mbps switchbased ATM LAN and a 10Mbps Ethernet. Ou ..."
Abstract

Cited by 526 (17 self)
 Add to MetaCart
. Our objective is to determine the efficiency of a userlevel DSM implementation on commercially available workstations and operating systems. We achieved good speedups on the 8processor ATM network for Jacobi (7.4), TSP (7.2), Quicksort (6.3), and ILINK (5.7). For a slightly modified version
A modified version of the Waxman algorithm
 J. PHYS. A: MATH. THEOR. 40 (2007) 5675–5680
, 2007
"... The iterative algorithm recently proposed by Waxman for solving eigenvalue problems, which relies on the method of moments, has been modified to improve its convergence considerably without sacrificing its benefits or elegance. The suggested modification is based on methods to calculate lowlying ei ..."
Abstract
 Add to MetaCart
The iterative algorithm recently proposed by Waxman for solving eigenvalue problems, which relies on the method of moments, has been modified to improve its convergence considerably without sacrificing its benefits or elegance. The suggested modification is based on methods to calculate low
A Modified Version of the Vigenère Algorithm
"... Stream ciphers in general tend to be weak since they lack the benefit of diffusion. It is for this reason alone that the Vigenère cipher is able to be cracked. Without the ability to detect cycles, and intern, derive the key length, the Vigenère cipher would be highly secure. By adding a few bits of ..."
Abstract
 Add to MetaCart
Stream ciphers in general tend to be weak since they lack the benefit of diffusion. It is for this reason alone that the Vigenère cipher is able to be cracked. Without the ability to detect cycles, and intern, derive the key length, the Vigenère cipher would be highly secure. By adding a few bits of random padding to each byte, one can diffuse the statistical retentiveness found within most messages. The exact quantity of pad will be determined by a one way function in an effort to eliminate the distinguishably of the message bits from the padded random bits. This methodology moderately increases the size of the cipher text, but greatly increases the security of the cipher Key words: Cryptography, Vigenere, Cypher.
This is an extended and slightly modified version of the manuscript
, 2012
"... We provide a detailed handson tutorial for the R addon package mboost. The package implements boosting for optimizing general risk functions utilizing componentwise (penalized) least squares estimates as baselearners for fitting various kinds of generalized linear and generalized additive models ..."
Abstract
 Add to MetaCart
We provide a detailed handson tutorial for the R addon package mboost. The package implements boosting for optimizing general risk functions utilizing componentwise (penalized) least squares estimates as baselearners for fitting various kinds of generalized linear and generalized additive models to potentially highdimensional data. We give a theoretical background and demonstrate how mboost can be used to fit interpretable models of different complexity. As an example we use mboost to predict the body fat based on anthropometric measurements throughout the tutorial. 1
Benchmarking Least Squares Support Vector Machine Classifiers
 NEURAL PROCESSING LETTERS
, 2001
"... In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set of eq ..."
Abstract

Cited by 476 (46 self)
 Add to MetaCart
In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set
Fully homomorphic encryption using ideal lattices
 In Proc. STOC
, 2009
"... We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result – that, to construct an encryption scheme that permits evaluation of arbitra ..."
Abstract

Cited by 663 (17 self)
 Add to MetaCart
of arbitrary circuits, it suffices to construct an encryption scheme that can evaluate (slightly augmented versions of) its own decryption circuit; we call a scheme that can evaluate its (augmented) decryption circuit bootstrappable. Next, we describe a public key encryption scheme using ideal lattices
The STATEMATE Semantics of Statecharts
, 1996
"... This article describes the semantics of the language of statecharts as implenented in the STATEMATE system [Harel et al. 1990; Harel and Politi 1996]. The initial version of this semantics was developed by a team about.10 years ago. With the added experience of the users of the system it has since b ..."
Abstract

Cited by 657 (12 self)
 Add to MetaCart
This article describes the semantics of the language of statecharts as implenented in the STATEMATE system [Harel et al. 1990; Harel and Politi 1996]. The initial version of this semantics was developed by a team about.10 years ago. With the added experience of the users of the system it has since
An affine invariant interest point detector
 In Proceedings of the 7th European Conference on Computer Vision
, 2002
"... Abstract. This paper presents a novel approach for detecting affine invariant interest points. Our method can deal with significant affine transformations including large scale changes. Such transformations introduce significant changes in the point location as well as in the scale and the shape of ..."
Abstract

Cited by 1467 (55 self)
 Add to MetaCart
by local extrema of normalized derivatives over scale. 3) An affineadapted Harris detector determines the location of interest points. A multiscale version of this detector is used for initialization. An iterative algorithm then modifies location, scale and neighbourhood of each point and converges
Results 1  10
of
9,490