Sciweavers

6110 search results - page 53 / 1222
» Approximate Computing
Sort
View
108
Voted
COMGEO
2008
ACM
15 years 2 months ago
Approximating polyhedral objects with deformable smooth surfaces
We propose a method to approximate a polyhedral object with a deformable smooth surface, namely the t-skin defined by Edelsbrunner
Ho-Lun Cheng, Tony Tan
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 5 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
114
Voted
GBRPR
2009
Springer
15 years 7 months ago
A Recursive Embedding Approach to Median Graph Computation
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valven...
90
Voted
IPPS
2008
IEEE
15 years 9 months ago
Optimal spot-checking to minimize the computation time in volunteer computing
This paper proposes an optimization technique for spotchecking to minimize the computation time of volunteer computing (VC) systems with malicious participants who return erroneou...
Kan Watanabe, Masaru Fukushi, Susumu Horiguchi
DAC
2000
ACM
16 years 3 months ago
To split or to conjoin: the question in image computation
Image computation is the key step in fixpoint computations that are extensively used in model checking. Two techniques have been used for this step: one based on conjunction of the...
In-Ho Moon, James H. Kukula, Kavita Ravi, Fabio So...