Sciweavers

6251 search results - page 1246 / 1251
» Randomness, Computability, and Density
Sort
View
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 3 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
WWW
2011
ACM
13 years 3 months ago
Estimating sizes of social networks via biased sampling
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
Liran Katzir, Edo Liberty, Oren Somekh
SCIENTOMETRICS
2010
141views more  SCIENTOMETRICS 2010»
13 years 3 months ago
Acceleration of citing behavior after the millennium? Exemplary bibliometric reference analyses for psychology journals
With reference to social constructivist approaches on citing behavior in the sciences, the hypothesis of acceleration of citing behavior after the millennium was empirically tested...
Günter Krampen
SIAMIS
2010
141views more  SIAMIS 2010»
13 years 3 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 3 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
« Prev « First page 1246 / 1251 Last » Next »