Sciweavers

5785 search results - page 969 / 1157
» Approximability of Probability Distributions
Sort
View
FSS
2002
84views more  FSS 2002»
15 years 3 months ago
A possibilistic approach to selecting portfolios with highest utility score
The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this ...
Christer Carlsson, Robert Fullér, Pé...
JCB
2002
70views more  JCB 2002»
15 years 3 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
JSAC
2010
138views more  JSAC 2010»
15 years 2 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar
ICS
2011
Tsinghua U.
14 years 7 months ago
High performance linpack benchmark: a fault tolerant implementation without checkpointing
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
Teresa Davies, Christer Karlsson, Hui Liu, Chong D...
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
13 years 6 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield