Results 1 - 10 of 1,994

A SLIGHT MODIFICATION OF THE FIRST PHASE OF THE SIMPLEX ALGORITHM

by T. Divnić, Lj. Pavlović , 2012
"... In this paper we give a modification of the first phase procedure for transforming the linear programming problem, given in the standard form to the canonical form, i.e., to the form with one feasible primal basis where standard simplex algorithm can be applied directly. The main idea of the paper ..."
Abstract - Add to MetaCart
In this paper we give a modification of the first phase procedure for transforming the linear programming problem, given in the standard form to the canonical form, i.e., to the form with one feasible primal basis where standard simplex algorithm can be applied directly. The main idea

CHI Conference Publications Format (With slight modifications for UbiComp 2003)

by John Doe, Mary Smith
"... In this paper, we describe the formatting requirements for the CHI Conference and offer a number of suggestions on writing style for the worldwide CHI readership. ..."
Abstract - Add to MetaCart
In this paper, we describe the formatting requirements for the CHI Conference and offer a number of suggestions on writing style for the worldwide CHI readership.

Climate and atmospheric history of the past 420,000 years from the Vostok ice core,

by J R Petit , J Jouzel , D Raynaud , N I Barkov , J.-M Barnola , I Basile , M Bender , J Chappellaz , M Davisk , G Delaygue , M Delmotte , V M Kotlyakov , M Legrand , V Y Lipenkov , C Lorius , L Pé , C Ritz , E Saltzmank , M Stievenard - Antarctica. Nature , 1999
"... Antarctica has allowed the extension of the ice record of atmospheric composition and climate to the past four glacial-interglacial cycles. The succession of changes through each climate cycle and termination was similar, and atmospheric and climate properties oscillated between stable bounds. Inte ..."
Abstract - Cited by 716 (15 self) - Add to MetaCart
been performed using methods previously described except for slight modifications (see The detailed record of dD ice

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
X passes to its parent U; is given by: and the message X sends to its child Y j is given by: k;Cj For noisy-or links between parents and children, there exists an analytic expression for 1r( x) and Ax ( u;) that avoids the exhaustive enumeration over parent config urations We made a slight

Edge Detection and Ridge Detection with Automatic Scale Selection

by Tony Lindeberg - CVPR'96 , 1996
"... When extracting features from image data, the type of information that can be extracted may be strongly dependent on the scales at which the feature detectors are applied. This article presents a systematic methodology for addressing this problem. A mechanism is presented for automatic selection of ..."
Abstract - Cited by 347 (24 self) - Add to MetaCart
across the edge. With slight modifications, this idea can be used for formulating a ridge detector with automatic scale selection, having the characteristic property that the selected scales on a scale-space ridge instead reflect the width of the ridge.

The bayesian lasso

by Trevor Park , 2005
"... The Lasso estimate for linear regression parameters can be interpreted as a Bayesian posterior mode estimate when the regression parameters have in-dependent Laplace (double-exponential) priors. Gibbs sampling from this pos-terior is possible using an expanded hierarchy with conjugate normal priors ..."
Abstract - Cited by 284 (0 self) - Add to MetaCart
, the structure of the hierarchical model provides both Bayesian and likelihood meth-ods for selecting the Lasso parameter. Slight modifications lead to Bayesian versions of other Lasso-related estimation methods like bridge regression and a robust variant.

Capacity Regions for Wireless Ad Hoc Networks

by Stavros Toumpis , Andrea J. Goldsmith - IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS , 2003
"... We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all source-destination pairs in the network under various transmission strategies, such as variable-rate transmissi ..."
Abstract - Cited by 283 (16 self) - Add to MetaCart
-rate transmission, single-hop or multihop routing, power control, and successive interference cancellation (SIC). Multihop cellular networks and networks with energy constraints are studied as special cases. With slight modifications, the developed formulation can handle node mobility and time-varying flat

An Evaluation of Directory Schemes for Cache Coherence

by Anant Agarwal, Richard Simoni, John Hennessy, Mark Horowitz - In Proceedings of the 15th Annual International Symposium on Computer Architecture , 1988
"... The problem of cache coherence in shared-memory multiprocessors has been addressed using two basic approaches: directory schemes and snoopy cache schemes. Directory schemes have been given less attention in the past several years, while snoopy cache methods have become extremely popular. Directory s ..."
Abstract - Cited by 257 (19 self) - Add to MetaCart
schemes for cache coherence are potentially attractive in large multiprocessor systems that are beyond the scaling limits of the snoopy cache schemes. Slight modifications to directory schemes can make them competitive in performance with snoopy cache schemes for small multiprocessors. Trace driven

Checking Computations in Polylogarithmic Time

by László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy , 1991
"... . Motivated by Manuel Blum's concept of instance checking, we consider new, very fast and generic mechanisms of checking computations. Our results exploit recent advances in interactive proof protocols [LFKN92], [Sha92], and especially the MIP = NEXP protocol from [BFL91]. We show that every no ..."
Abstract - Cited by 260 (10 self) - Add to MetaCart
in polylogarithmic Monte Carlo time; and (iii) a witness satisfying S 0 can be computed in polynomial time from a witness satisfying S. Here the instance and the description of S have to be provided in error-correcting code (since the checker will not notice slight changes). A modification of the MIP proof

Cryptanalysis of sflash with slightly modified parameters

by Vivien Dubois, Pierre-alain Fouque, Jacques Stern - In Eurocrypt ’07 , 2007
"... Abstract. SFLASH is a signature scheme which belongs to a family of multivariate schemes proposed by Patarin et al. in 1998 [9]. The SFLASH scheme itself has been designed in 2001 [8] and has been selected in 2003 by the NESSIE European Consortium [6] as the best known solution for implementation on ..."
Abstract - Cited by 17 (8 self) - Add to MetaCart
on low cost smart cards. In this paper, we show that slight modifications of the parameters of SFLASH within the general family initially proposed renders the scheme insecure. The attack uses simple linear algebra, and allows to forge a signature for an arbitrary message in a question of minutes
Results 1 - 10 of 1,994