Sciweavers

1763 search results - page 73 / 353
» Dependent random choice
Sort
View
KES
2010
Springer
13 years 7 months ago
Extracting Principal Components from Pseudo-random Data by Using Random Matrix Theory
We develop a methodology to grasp temporal trend in a stock market that changes year to year, or sometimes within a year depending on numerous factors. For this purpose, we employ ...
Mieko Tanaka-Yamawaki
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 4 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
14 years 27 days ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim
ICCV
2007
IEEE
14 years 11 months ago
Spatial Random Partition for Common Visual Pattern Discovery
Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Althoug...
Junsong Yuan, Ying Wu
WAW
2009
Springer
150views Algorithms» more  WAW 2009»
14 years 3 months ago
The Giant Component in a Random Subgraph of a Given Graph
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
Fan Chung Graham, Paul Horn, Linyuan Lu