3708 search results - page 187 / 742 » Approximating Betweenness Centrality |
132
Voted
IH
2009
Springer
16 years 19 days ago
2009
Springer
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
160
click to vote
RSFDGRC
2005
Springer
15 years 11 months ago
2005
Springer
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...
182
click to vote
IMR
2003
Springer
15 years 11 months ago
2003
Springer
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
183
click to vote
CVPR
2009
IEEE
15 years 10 months ago
2009
IEEE
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
139
click to vote
COMPGEOM
2008
ACM
15 years 7 months ago
2008
ACM
Given a fixed origin o in the d-dimensional grid, we give a novel definition of digital rays dig(op) from o to each grid point p. Each digital ray dig(op) approximates the Euclide...