Results 1  10
of
13,205
Robust wide baseline stereo from maximally stable extremal regions
 In Proc. BMVC
, 2002
"... The widebaseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements that are put into correspondence, the so called extremal regions, is introduced. Extremal regions possess highly desir ..."
Abstract

Cited by 1016 (35 self)
 Add to MetaCart
sirable properties: the set is closed under 1. continuous (and thus projective) transformation of image coordinates and 2. monotonic transformation of image intensities. An efficient (near linear complexity) and practically fast detection algorithm (near frame rate) is presented for an affinelyinvariant stable
A theory of the term structure of interest rates,
 Econometrika,
, 1985
"... Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted d ..."
Abstract

Cited by 1979 (3 self)
 Add to MetaCart
. Ross This paper uses an intertemporal general equilibrium asset pricing model to study the term structure of interest rates. In this model, anticipations, risk aversion, investment alternatives, and preferences about the timing of consumption all play a role in determining bond prices. Many
Optimization Flow Control, I: Basic Algorithm and Convergence
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract

Cited by 694 (64 self)
 Add to MetaCart
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm
Energy Conserving Routing in Wireless Adhoc Networks
, 2000
"... An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
the set of possible one hop away neighbors. Traffic forwarding through multiple hops is employed when the intended destination is not within immediate reach. The nodes have limited initial amounts of energy that is consumed in different rates depending on the power level and the intended receiver. We
Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding
 IEEE TRANS. ON INFORMATION THEORY
, 1999
"... We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing informationembedding rate, mini ..."
Abstract

Cited by 496 (14 self)
 Add to MetaCart
We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing informationembedding rate
The Nonstochastic Multiarmed Bandit Problem
 SIAM JOURNAL OF COMPUTING
, 2002
"... In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying out ..."
Abstract

Cited by 491 (34 self)
 Add to MetaCart
In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying
Power provisioning for a warehousesized computer,”
 ACM SIGARCH Computer Architecture News,
, 2007
"... ABSTRACT Largescale Internet services require a computing infrastructure that can be appropriately described as a warehousesized computing system. The cost of building datacenter facilities capable of delivering a given power capacity to such a computer can rival the recurring energy consumption ..."
Abstract

Cited by 450 (2 self)
 Add to MetaCart
costs themselves. Therefore, there are strong economic incentives to operate facilities as close as possible to maximum capacity, so that the nonrecurring facility costs can be best amortized. That is difficult to achieve in practice because of uncertainties in equipment power ratings and because power
A Novel Construction of Complex Orthogonal Designs with Maximal Rate and LowPAPR
"... Abstract — Spacetime block codes based on orthogonal designs are used for wireless communications with multiple transmit antennas which can achieve full transmit diversity and have low decoding complexity. However, the rate of the square real/complex orthogonal designs tends to zero with increase i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
in number of antennas, while it is possible to have a rate1 real orthogonal design (ROD) for any number of antennas. In case of complex orthogonal designs (CODs), rate1 codes exist only for 1 and 2 antennas. In general, For n transmit antennas, the maximal rate of a COD is 1 1 1 1 + or + for n even or odd
Maximal rates of excretion and synthesis of urea in normal and cirrhotic subjects.
 J Clin Invest
, 1973
"... A B S T R A C T When normal individuals eat 0.33 g protein N/kg body weight (BW)3' per day, they excrete 1015 mg urea N/h per kg BW3'4. If they now ingest (at 0 h) 0.27 (dose A), 0.40 (dose B), 0.53 (dose C), 0.94 (dose D), or 1.33 (dose E) g protein N/kg BW3' (in the form of casein ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
of casein, ovalbumin, or lactalbumin), the rate of urea N excretion accelerates within 4 h. At dose C a maximal rate of urinary urea N excretion (MRUE) is reached, which averages 55 mg urea N/h per kg BW3' and which persists for 16 h. Higher doses of protein do not further accelerate urea excretion
Results 1  10
of
13,205