Sciweavers

151 search results - page 26 / 31
» Optimal (2, n) visual cryptographic schemes
Sort
View
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
14 years 1 months ago
Adaptive variance scaling in continuous multi-objective estimation-of-distribution algorithms
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
Peter A. N. Bosman, Dirk Thierens
PODS
2004
ACM
148views Database» more  PODS 2004»
14 years 7 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar
MONET
2008
77views more  MONET 2008»
13 years 7 months ago
On Relay Node Placement and Assignment for Two-tiered Wireless Networks
Wireless networks that operate on batteries are imposed with energy constraints and long distance communications between nodes are not desirable. Implementing Relay Nodes (RNs) can...
Wenxuan Guo, Xin-Ming Huang, Wenjing Lou, Cao Lian...
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
14 years 7 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 4 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri