5115 search results - page 127 / 1023 » On Randomized Lanczos Algorithms |
169
click to vote
GPEM
2007
15 years 6 months ago
2007
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
166
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
170
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
157
click to vote
ICC
2008
IEEE
16 years 24 days ago
2008
IEEE
—The IEEE 802.16 standard, or WiMAX, has emerged as one of the strongest contenders for broadband wireless access technology. In our previous work, we proposed a protocol using r...
158
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...