Results 1  10
of
5,094
Optimal DNA signal recognition models with a fixed amount of intrasignal dependency
 WABI 2003: Algorithms and Bioinformatics: 3rd International Workshop, volume 2812 of Lecture Notes in Bioinformatics
, 2003
"... We study new probabilistic models for signals in DNA. Our models allow dependencies between multiple nonadjacent positions, in a generative model we call a higherorder tree. Computing the model of maximum likelihood is equivalent in our context to computing a minimum directed spanning hypergra ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study new probabilistic models for signals in DNA. Our models allow dependencies between multiple nonadjacent positions, in a generative model we call a higherorder tree. Computing the model of maximum likelihood is equivalent in our context to computing a minimum directed spanning hypergraph, a problem we show is NPcomplete.
Timing Attacks on Implementations of DiffieHellman, RSA, DSS, and Other Systems
, 1996
"... By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed DiffieHellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known cip ..."
Abstract

Cited by 651 (3 self)
 Add to MetaCart
By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed DiffieHellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known
The Cache Performance and Optimizations of Blocked Algorithms
 In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems
, 1991
"... Blocking is a wellknown optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorithms operate on submatrices or blocks, so that data loaded into the faster levels of the memory hierarchy are reused. This ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
. This paper presents cache performance data for blocked programs and evaluates several optimizations to improve this performance. The data is obtained by a theoretical model of data conflicts in the cache, which has been validated by large amounts of simulation. We show that the degree of cache interference
Monopolistic competition and optimum product diversity. The American Economic Review,
, 1977
"... The basic issue concerning production in welfare economics is whether a market solution will yield the socially optimum kinds and quantities of commodities. It is well known that problems can arise for three broad reasons: distributive justice; external effects; and scale economies. This paper is c ..."
Abstract

Cited by 1911 (5 self)
 Add to MetaCart
is concerned with the last of these. The basic principle is easily stated.' A commodity should be produced if the costs can be covered by the sum of revenues and a properly defined measure of consumer's surplus. The optimum amount is then found by equating the demand price and the marginal cost
L 2 BLOWUP SOLUTIONS OF CUBIC NLS ON R 2 CONCENTRATE A FIXED AMOUNT OF MASS
, 2004
"... Abstract. We consider finite time blowup solutions of the L 2 critical focusing nonlinear SchrÃ¶dinger equation on R 2. A perturbation analysis exploiting a representation forumla and asymptotic orthogonality properties obtained by Merle and Vega shows that a fixed amount of L 2 mass is parabolically ..."
Abstract
 Add to MetaCart
Abstract. We consider finite time blowup solutions of the L 2 critical focusing nonlinear SchrÃ¶dinger equation on R 2. A perturbation analysis exploiting a representation forumla and asymptotic orthogonality properties obtained by Merle and Vega shows that a fixed amount of L 2 mass
A Convergence Result Of Dropping Time Of A Decoder With A Fixed Amount Of Storage
, 2001
"... We consider the stochastic behavior of dropping time of a decoder with M frame bu#ers. It can be formulated as the following stochastic problem. Suppose X1 , X2 , . . . , are independent and identically distributed random variables. Suppose W0 and W i = max{W i1 + X i , 0}, i = 1, 2, . . . . For a ..."
Abstract
 Add to MetaCart
, it implies that the tail probability sequence P{D # n} is asymptotically a geometric sequence. Our result helps to understand some stochastic phenomena in applications. For example, for a decoder with fixed amount of storage, its framedropping time can be formulated as in this model. Our result provides
HT200572719 HEAT TRANSFER IN CAVITIES HAVING A FIXED AMOUNT OF SOLID MATERIAL
"... ABSTRACT This work compares two different approaches for obtaining numerical solutions for laminar natural convection within a square cavity, which is filled by a fixed amount of a solid conducting material. The first model considered, namely, porouscontinuum model, is based on the assumption that ..."
Abstract
 Add to MetaCart
ABSTRACT This work compares two different approaches for obtaining numerical solutions for laminar natural convection within a square cavity, which is filled by a fixed amount of a solid conducting material. The first model considered, namely, porouscontinuum model, is based on the assumption
Resource pricing and the evolution of congestion control
, 1999
"... We describe ways in which the transmission control protocol of the Internet may evolve to support heterogeneous applications. We show that by appropriately marking packets at overloaded resources and by charging a fixed small amount for each mark received, endnodes are provided with the necessary i ..."
Abstract

Cited by 350 (7 self)
 Add to MetaCart
We describe ways in which the transmission control protocol of the Internet may evolve to support heterogeneous applications. We show that by appropriately marking packets at overloaded resources and by charging a fixed small amount for each mark received, endnodes are provided with the necessary
Major Functional Series 300: Acquisition & Assistance Agreement ADS Chapter 317 PROCUREMENT UNDER FIXED AMOUNT REIMBURSEMENT ACTIVITIES
"... Please note that numbering and editorial changes were made to ADS 317 for DRCD 9. The changes are reflected below. ..."
Abstract
 Add to MetaCart
Please note that numbering and editorial changes were made to ADS 317 for DRCD 9. The changes are reflected below.
New Directions in Traffic Measurement and Accounting
, 2001
"... Accurate network traffic measurement is required for accounting, bandwidth provisioning, and detecting DOS attacks. However, keeping a counter to measure the traffic sent by each of a million concurrent flows is too expensive (using SRAM) or slow (using DRAM). The current stateoftheart (e.g., Cis ..."
Abstract

Cited by 353 (11 self)
 Add to MetaCart
showing that a number of simple solutions based on cached counters and classical sampling do not work, we describe two novel and scalable schemes for this purpose which take a constant number of memory references per packet and use a small amount of memory. Further, unlike NetFlow estimates, we have
Results 1  10
of
5,094