Results 11  20
of
24,389
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
, 2001
"... Variable selection is fundamental to highdimensional statistical modeling, including nonparametric regression. Many approaches in use are stepwise selection procedures, which can be computationally expensive and ignore stochastic errors in the variable selection process. In this article, penalized ..."
Abstract

Cited by 948 (62 self)
 Add to MetaCart
functions are symmetric, nonconcave on (0, ∞), and have singularities at the origin to produce sparse solutions. Furthermore, the penalty functions should be bounded by a constant to reduce bias and satisfy certain conditions to yield continuous solutions. A new algorithm is proposed for optimizing
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
, 1992
"... We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many of the examp ..."
Abstract

Cited by 460 (20 self)
 Add to MetaCart
at constant rates. The two procedures are based, respectively, on minimizing and computing fixpoints on generally infinite state spaces. We show that if the procedures terminate, then they give correct answers. We then demonstrate that for many of the typical workshop examples, the procedures do terminate
Optimal Scheduling for ConstantRate MultiMode Systems
"... Constantrate multimode systems are hybrid systems that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of realvalued variables with modedependent constant rates. The schedulability problem for such systems is to design a modeswitching policy tha ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Constantrate multimode systems are hybrid systems that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of realvalued variables with modedependent constant rates. The schedulability problem for such systems is to design a modeswitching policy
Eigentaste: A Constant Time Collaborative Filtering Algorithm
, 2000
"... Eigentaste is a collaborative filtering algorithm that uses universal queries to elicit realvalued user ratings on a common set of items and applies principal component analysis (PCA) to the resulting dense subset of the ratings matrix. PCA facilitates dimensionality reduction for offline clusterin ..."
Abstract

Cited by 378 (6 self)
 Add to MetaCart
Eigentaste is a collaborative filtering algorithm that uses universal queries to elicit realvalued user ratings on a common set of items and applies principal component analysis (PCA) to the resulting dense subset of the ratings matrix. PCA facilitates dimensionality reduction for offline
The highly irregular firing of cortical cells is inconsistent with temporal integration of random EPSPs
 Journal of Neuroscience
, 1993
"... How random is the discharge pattern of cortical neurons? We examined recordings from primary visual cortex (Vl; Knierim and Van Essen, 1992) and extrastriate cortex (MT; Newsome et al., 1989a) of awake, behaving macaque monkey and compared them to analytical predictions. For nonbursting cells firi ..."
Abstract

Cited by 457 (11 self)
 Add to MetaCart
firing at sustained rates up to 300 Hz, we evaluated two indices of firing variability: the ratio of the variance to the mean for the number of action potentials evoked by a constant stimulus, and the ratenormalized coefficient of variation (C,) of the interspike interval distribution. Firing
Videoondemand over ATM: Constantrate transmission and transport
 IEEE Journal on Selected Areas in Communications
, 1996
"... Abstract We introduce a specific transport and transmission scheme for videoondemand (VoD) called constantrate transmission and transport (CRTT). CRTT establishes a constant bitrate (CBR) virtual channel between the video provider and the viewer’s settop box (STB) and then transmits cells fro ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
Abstract We introduce a specific transport and transmission scheme for videoondemand (VoD) called constantrate transmission and transport (CRTT). CRTT establishes a constant bitrate (CBR) virtual channel between the video provider and the viewer’s settop box (STB) and then transmits cells
Topology Control for Constant Rate Mobile Networks
"... Abstract — Controlling the topology of a wireless ad hoc network is very important from the point of view of performance. One known technique for controlling the topology is through the assignment of appropriate transmission power levels to the nodes. Such an assignment aims to minimize a specified ..."
Abstract
 Add to MetaCart
define a topology control problem under the Constant Rate Mobile Network model. In this model, all the n nodes in the network may move. Associated with each moving node are its constant moving speed and direction. The goal is to minimize the maximum power used by any network node in producing a connected
A constant recontracting model of sovereign debt
 Journal of Political Economy
, 1989
"... Few sovereign debtors have repudiated their obligations entirely. But despite the significant sanctions at the disposal of lenders, many borrowers have been able to consistently negotiate for reduced repayments. This paper presents a model of the ongoing bargaining process that determines repayment ..."
Abstract

Cited by 349 (11 self)
 Add to MetaCart
repayment levels. We derive a bargaining equilibrium in which countries with large debts achieve negotiated partial default. The ability to credibly threaten more draconian penalties in the event of repudiation may be of no benefit to lenders. Furthermore, unanticipated increases in world interest rates may
Constant rate approximate maximum margin algorithms
 ECML 2006, LNAI 4212 (2006) 437–448, SpringerVerlag
, 2006
"... Abstract. We present a new class of perceptronlike algorithms with margin in which the “effective ” learning rate, defined as the ratio of the learning rate to the length of the weight vector, remains constant. We prove that the new algorithms converge in a finite number of steps and show that ther ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. We present a new class of perceptronlike algorithms with margin in which the “effective ” learning rate, defined as the ratio of the learning rate to the length of the weight vector, remains constant. We prove that the new algorithms converge in a finite number of steps and show
Searching with a Constant Rate of Malicious Lies
"... The problem of searching in the presence of errors is modeled as a game between a questioner and a responder. The responder chooses an integer x 2 f1; : : : ; ng; and the questioner has to determine x asking comparison queries. The responder may lie at his pleasure, provided that at the end of t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of the game the fraction of lies does not exceed a certain constant r: It is known that the questioner may win the game if and only if r < 1=3: Under the latter hypothesis, we analyze two questioning strategies; both of them improve on the existing upper bounds. 1
Results 11  20
of
24,389