Sciweavers

2996 search results - page 65 / 600
» Numberings and Randomness
Sort
View
CPC
1998
123views more  CPC 1998»
13 years 9 months ago
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
Michael Molloy, Bruce A. Reed
JSYML
2011
87views more  JSYML 2011»
13 years 5 months ago
Benign cost functions and lowness properties
We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost functi...
Noam Greenberg, André Nies
ICDT
2007
ACM
87views Database» more  ICDT 2007»
14 years 4 months ago
Query Evaluation on a Database Given by a Random Graph
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
Nilesh N. Dalvi
NECO
2006
76views more  NECO 2006»
13 years 10 months ago
Spontaneous Dynamics of Asymmetric Random Recurrent Spiking Neural Networks
We study in this paper the effect of an unique initial stimulation on random recurrent networks of leaky integrate and fire neurons. Indeed given a stochastic connectivity this so...
Hédi Soula, Guillaume Beslon, Olivier Mazet
NIPS
2007
13 years 11 months ago
A Randomized Algorithm for Large Scale Support Vector Learning
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...
Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariha...