Sciweavers

164 search results - page 33 / 33
» The Kolmogorov complexity of random reals
Sort
View
BMCBI
2005
127views more  BMCBI 2005»
13 years 4 months ago
Are scale-free networks robust to measurement errors?
Background: Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false nega...
Nan Lin, Hongyu Zhao
JSC
2010
155views more  JSC 2010»
13 years 3 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
WWW
2011
ACM
12 years 11 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
AAAI
2011
12 years 4 months ago
Learned Behaviors of Multiple Autonomous Agents in Smart Grid Markets
One proposed approach to managing a large complex Smart Grid is through Broker Agents who buy electrical power from distributed producers, and also sell power to consumers, via a ...
Prashant P. Reddy, Manuela M. Veloso