5595 search results - page 973 / 1119 » Approximation Algorithms for Clustering Problems |
158
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
171
click to vote
WSCG
2003
15 years 7 months ago
2003
Real-time rendering of vegetation is one of the most important challenges in outdoor scenes. This is due to the vast amount of polygons that are used to model vegetable species. M...
185
click to vote
WSDM
2012
ACM
14 years 1 months ago
2012
ACM
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...
170
click to vote
COMPGEOM
2009
ACM
16 years 16 days ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
178
click to vote
INFOCOM
2008
IEEE
16 years 13 days ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...