Sciweavers

5595 search results - page 757 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
TMI
2002
115views more  TMI 2002»
15 years 6 months ago
Discretization of the Radon transform and of its inverse by spline convolutions
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
Stefan Horbelt, Michael Liebling, Michael Unser
TACAS
2010
Springer
162views Algorithms» more  TACAS 2010»
16 years 1 months ago
Computing the Leakage of Information-Hiding Systems
We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the oth...
Miguel E. Andrés, Catuscia Palamidessi, Pet...
INFOCOM
2008
IEEE
16 years 1 months ago
Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
Xin Wang, J. J. Garcia-Luna-Aceves
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
16 years 9 days ago
Nonlinear feature extraction using a neuro genetic hybrid
Feature extraction is a process that extracts salient features from observed variables. It is considered a promising alternative to overcome the problems of weight and structure o...
Yung-Keun Kwon, Byung Ro Moon
179
Voted
FSTTCS
2004
Springer
16 years 5 days ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala