Sciweavers

413 search results - page 40 / 83
» Coding discretizations of continuous functions
Sort
View
DCC
2005
IEEE
14 years 7 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 7 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
IROS
2007
IEEE
112views Robotics» more  IROS 2007»
14 years 2 months ago
Orchestrating concurrency in robot swarms
— A functional approach to programming robot swarms brings with it well-defined properties that allow for automated concurrency and distributed execution. Further, the particula...
Anthony Cowley, Camillo J. Taylor
COMPGEOM
2009
ACM
14 years 2 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
ECMAST
1998
Springer
118views Multimedia» more  ECMAST 1998»
13 years 12 months ago
Error-Robustness of Polar Contour-Coding
For communication using digital video, compression is mandatory because of the high bit-rate requiring a large bandwidth or storage capacity. Recent developments as well as upcomi...
Frank H. P. Spaan, Reginald L. Lagendijk, Jan Biem...