205 search results - page 23 / 41 » On Approximation Algorithms for Hierarchical MAX-SAT |
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
125
click to vote
PODS
2003
ACM
15 years 12 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
SMI
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper a novel clustering algorithm is proposed, namely Variational Multilevel Mesh Clustering (VMLC). The algorithm incorporates the advantages of both hierarchical and va...
SIGGRAPH
1994
ACM
15 years 3 months ago
1994
ACM
In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm. This extension of the standard algorithm allows...
RT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Lighting design is often tedious due to the required physical manipulation of real light sources and objects. As an alternative, we present an interactive system to virtu...