Sciweavers

7228 search results - page 431 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
SIAMSC
2008
132views more  SIAMSC 2008»
15 years 6 months ago
Stochastic Preconditioning for Diagonally Dominant Matrices
Abstract. This paper presents a new stochastic preconditioning approach for large sparse matrices. For the class of matrices that are row-wise and column-wise irreducibly diagonall...
Haifeng Qian, Sachin S. Sapatnekar
WICON
2008
15 years 8 months ago
Optimal stochastic routing in low duty-cycled wireless sensor networks
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
Dongsook Kim, Mingyan Liu
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
STOC
2004
ACM
76views Algorithms» more  STOC 2004»
16 years 7 months ago
Isotopic implicit surface meshing
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a...
Jean-Daniel Boissonnat, David Cohen-Steiner, Gert ...
COMPGEOM
2006
ACM
16 years 23 days ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii