Results 11  20
of
2,163,724
A Comparative Study on Feature Selection in Text Categorization
, 1997
"... This paper is a comparative study of feature selection methods in statistical learning of text categorization. The focus is on aggressive dimensionality reduction. Five methods were evaluated, including term selection based on document frequency (DF), information gain (IG), mutual information (MI), ..."
Abstract

Cited by 1296 (15 self)
 Add to MetaCart
precision) . DF thresholding performed similarly. Indeed we found strong correlations between the DF, IG and CHI values of a term. This suggests that DF thresholding, the simplest method with the lowest cost in computation, can be reliably used instead of IG or CHI when the computation of these measures
Governance in Global Value Chains
 IDS Bulletin Special Issue on The Value of Value Chains
, 2001
"... This article builds a theoretical framework to help explain governance patterns in global value chains. It draws on three streams of literature – transaction costs economics, production networks, and technological capability and firmlevel learning – to identify three variables that play a large rol ..."
Abstract

Cited by 411 (26 self)
 Add to MetaCart
This article builds a theoretical framework to help explain governance patterns in global value chains. It draws on three streams of literature – transaction costs economics, production networks, and technological capability and firmlevel learning – to identify three variables that play a large
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 456 (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
Managerial Discretion and Optimal Financing Policies
 J. Finan. Econ
, 1990
"... I analyze financing policies in a firm owned by atomistic shareholders who observe neither cash flows nor management’s investment decisions. Management derives perquisites from investment and invests as much as possible. Since it always claims that cash flow is too low to fund all positive net prese ..."
Abstract

Cited by 435 (17 self)
 Add to MetaCart
present value projects. its claim is not credible when cash flow is truly low. Consequently, management is forced to invest too little when cash flow is low and chooses to invest too much when it is high. Financing policies, by influencing the resources under management’s control, can reduce the costs
Efficient Implementation of Weighted ENO Schemes
, 1995
"... In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially nonoscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accur ..."
Abstract

Cited by 406 (38 self)
 Add to MetaCart
and entropy instead of the characteristic values to simplify the costly characteristic procedure. The resulting WENO schemes are about twice as fast as the WENO schemes using the characteristic decompositions to compute weights, and work well for problems which donot contain strong shocks or strong reflected
A Model of Political Competition with CitizenCandidates
 JOURNAL OF ECONOMICS
, 1996
"... We develop a model of electoral competition in which citizens choose whether or not to run as candidates; a winner implements her favorite policy. The equilibrium number of candidates depends negatively on the cost of running and positively on the benefits of winning. For some parameter values all e ..."
Abstract

Cited by 397 (6 self)
 Add to MetaCart
We develop a model of electoral competition in which citizens choose whether or not to run as candidates; a winner implements her favorite policy. The equilibrium number of candidates depends negatively on the cost of running and positively on the benefits of winning. For some parameter values all
Valued constraint satisfaction problems: Hard and easy problems
 IJCAI’95: PROCEEDINGS INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1995
"... In order to deal with overconstrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+, max...) to aggregate constraint violat ..."
Abstract

Cited by 330 (42 self)
 Add to MetaCart
In order to deal with overconstrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+, max...) to aggregate constraint
Firing costs; menu costs; value of the firm
"... ABSTRACT: This paper suggests that in order to optimally reorganize its workforce a firm sorts all incumbent workers according to each worker’s expected future value. Once the size of the reorganization has been determined, the lowest value workers will be dismissed. A structural labor demand model ..."
Abstract
 Add to MetaCart
with menu costs derived from heterogeneous irreversible firing costs is presented to determine a worker’s idiosyncratic value to the firm. An econometric analysis using personnel records from a European aircraft building firm shows that a reorganizational design that accounts for idiosyncratic firing costs
Sharing the Cost of Multicast Transmissions
, 2001
"... We investigate costsharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in this context. We prove that the former has a natural algorithm that uses only two messages per link o ..."
Abstract

Cited by 284 (16 self)
 Add to MetaCart
We investigate costsharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in this context. We prove that the former has a natural algorithm that uses only two messages per link
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Results 11  20
of
2,163,724