Results 1  10
of
3,559
Proper Bounded EdgeColorings
"... For fixed integers k 2, and for nelement sets X and colorings \Delta: [X] k \Gamma! f0; 1; : : :g where every color class is a matching and has cardinality at most u, we show that there exists a totally multicolored subset Y ` X with jY j max ( c 1 \Delta ` n k u ' 1 2k\Gamma1 ; c ..."
Abstract
 Add to MetaCart
; c 2 \Delta ` n k u ' 1 2k\Gamma1 \Delta ` ln ` u p n " 1 2k\Gamma1 ) where c 1 ; c 2 ? 0 are constants. This lower bound is tight up to constant factors for u = \Omega\Gamma n 1=2+ffl ) for every ffl ? 0. For fixed values of k we give a polynomial time algorithm
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2825 (11 self)
 Add to MetaCart
;enyi's nonmonotone result [Imm88, Sze87] that NL = coNL; this is a simple extension of the monotone circuit depth lower bound of Karchmer and Wigderson [KW90] for stconnectivity. We also consider mBWBP (monotone bounded width branching programs) and study the question of whether mBWBP is properly contained
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
Further Results On The Basis Of Cauchy’s Proper Bound for the Zeros of Entire Functions of Order Zero
"... ABSTRACT: A single valued function of one complex variable which is analytic in the finite complex plane is called an entire function. The purpose of this paper is to establish the bounds for the moduli of zeros of entire functions of order zero. ..."
Abstract
 Add to MetaCart
ABSTRACT: A single valued function of one complex variable which is analytic in the finite complex plane is called an entire function. The purpose of this paper is to establish the bounds for the moduli of zeros of entire functions of order zero.
Hierarchical Packet Fair Queueing Algorithms
 IEEE/ACM Transactions on Networking
, 1997
"... In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (HGPS) model to simultaneously support guaranteed realtime, rateadaptive besteffort, and controlled linksharing services. We design Hierarchical Packet Fair Queueing (HPFQ) algorithms to approximate HGPS ..."
Abstract

Cited by 341 (7 self)
 Add to MetaCart
GPS by using onelevel variablerate PFQ servers as basic building blocks. By computing the system virtual time and per packet virtual start/finish times in unit of bits instead of seconds, most of the PFQ algorithms in the literature can be properly defined as variablerate servers. We develop techniques
Backwardscompatible bounds checking for arrays and pointers in C programs
 in Distributed Enterprise Applications. HP Labs Tech Report
, 1997
"... functiontyped variables, virtual functions, and 7/7 callbacks. 8/8 Maintain shadow bitmap: Maintain a map indicating which storage regions are valid. Update it when stack allocations, malloc and free occur. Augment each memory access instruction with code to check whether the address is valid ..."
Abstract

Cited by 221 (0 self)
 Add to MetaCart
Invariant: Assume all stored pointers are properlyderived pointers to their intended referent Im
Performance and Stability of Communication Networks via Robust Exponential Bounds
 IEEE/ACM Transactions on Networking
, 1993
"... We propose a new way for evaluating the performance of packet switching communication networks under a fixed (session based) routing strategy. Our approach is based on properly bounding the probability distribution functions of the system input processes. The bounds we suggest, which are decaying ex ..."
Abstract

Cited by 150 (3 self)
 Add to MetaCart
We propose a new way for evaluating the performance of packet switching communication networks under a fixed (session based) routing strategy. Our approach is based on properly bounding the probability distribution functions of the system input processes. The bounds we suggest, which are decaying
Orbihedra Of Nonpositive Curvature
 Progress in Mathematics
, 1995
"... . A 2dimensional orbihedron of nonpositive curvature is a pair (X; \Gamma), where X is a 2dimensional simplicial complex with a piecewise smooth metric such that X has nonpositive curvature in the sense of Alexandrov and Busemann and \Gamma is a group of isometries of X which acts properly disc ..."
Abstract

Cited by 252 (10 self)
 Add to MetaCart
. A 2dimensional orbihedron of nonpositive curvature is a pair (X; \Gamma), where X is a 2dimensional simplicial complex with a piecewise smooth metric such that X has nonpositive curvature in the sense of Alexandrov and Busemann and \Gamma is a group of isometries of X which acts properly
Surrogate Regret Bounds for Proper Losses
"... We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the marginbased bounds due to Bartlett et al. (2006). The proof uses Taylor’s theorem and leads to new representations for loss and regret and a simple proof of the integral repr ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the marginbased bounds due to Bartlett et al. (2006). The proof uses Taylor’s theorem and leads to new representations for loss and regret and a simple proof of the integral
Results 1  10
of
3,559