6110 search results - page 356 / 1222 » Approximate Computing |
185
click to vote
ICDCS
2006
IEEE
16 years 24 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
163
click to vote
DEDS
2010
15 years 6 months ago
2010
We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
180
click to vote
TCS
2008
15 years 6 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
188
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
231
click to vote
CG
2011
Springer
15 years 1 months ago
2011
Springer
TON: Curve Network Abstraction for 3D Shapes Fernando de Goesa,∗ , Siome Goldensteinb , Mathieu Desbruna , Luiz Velhoc aCalifornia Institute of Technology, Pasadena, CA 91125, US...