450 search results - page 61 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
117
click to vote
SODA
2010
ACM
14 years 9 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
106
click to vote
SI3D
2005
ACM
15 years 5 months ago
2005
ACM
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
DCOSS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Wireless sensor networks come of age and start moving out of the laboratory into the field. As the number of deployments is increasing the need for an efficient and relia...
CPC
2004
14 years 11 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
HIPC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we describe the design and implementation of a C++ based Common Component Architecture (CCA) framework, XCAT-C++. It can efficiently marshal and unmarshal large data...