Sciweavers

1161 search results - page 21 / 233
» Approximation schemes for clustering problems
Sort
View
DCOSS
2010
Springer
15 years 2 months ago
A Novel Mobility Management Scheme for Target Tracking in Cluster-Based Sensor Networks
Abstract. Target tracking is a typical and important application of wireless sensor networks (WSNs). In the consideration of scalability and energy efficiency for target tracking ...
Zhibo Wang, Wei Lou, Zhi Wang, Junchao Ma, Honglon...
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 3 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
SIAMNUM
2011
139views more  SIAMNUM 2011»
14 years 4 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
TVCG
2011
175views more  TVCG 2011»
14 years 4 months ago
Parallel Iteration to the Radiative Transport in Inhomogeneous Media with Bootstrapping
—This paper presents a fast parallel method to solve the radiative transport equation in inhomogeneous participating media. We apply a novel approximation scheme to find a good ...
László Szirmay-Kalos, Gabor Liktor, ...
IPL
2008
132views more  IPL 2008»
14 years 9 months ago
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
Leah Epstein, Asaf Levin