371 search results - page 72 / 75 » Algorithms for the transportation problem in geometric setti... |
BMCBI
2011
12 years 11 months ago
2011
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
VISUALIZATION
1998
IEEE
13 years 12 months ago
1998
IEEE
Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A less studied problem is how to preserve on a simplified mesh the detail (e.g. co...
PAMI
2010
13 years 6 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...