Sciweavers

20 search results - page 2 / 4
» Discrete relations on abstract simplicial complexes
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
ALGOSENSORS
2008
Springer
13 years 9 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
BPM
2009
Springer
143views Business» more  BPM 2009»
13 years 8 months ago
MDPE Workbench - A Solution for Performance Related Decision Support
Abstract. Continuous optimization of business process execution including its adaptation to changes within the market environment or the company itself becomes increasingly importa...
Mathias Fritzsche, Jendrik Johannes, Sebastian Cec...
TMI
2002
115views more  TMI 2002»
13 years 7 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
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 6 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan