COCOON
2009
Springer
13 years 11 months ago
2009
Springer
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
0
posts
with
0
views
0
views
Homepage 
0
posts
with
0
views
0
views
First year math PhD student at MIT.