Sciweavers

2569 search results - page 269 / 514
» Approximate Objects and Approximate Theories
Sort
View
COLT
2007
Springer
16 years 25 days ago
Sketching Information Divergences
When comparing discrete probability distributions, natural measures of similarity are not p distances but rather are informationdivergences such as Kullback-Leibler and Hellinger. ...
Sudipto Guha, Piotr Indyk, Andrew McGregor
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
16 years 25 days ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
16 years 4 days ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
VLSM
2005
Springer
16 years 4 days ago
Fast Marching Method for Generic Shape from Shading
We develop a fast numerical method to approximate the solutions of a wide class of equations associated to the Shape From Shading problem. Our method, which is based on the control...
Emmanuel Prados, Stefano Soatto
DIALM
2004
ACM
100views Algorithms» more  DIALM 2004»
16 years 2 days ago
Virtual coordinates for ad hoc and sensor networks
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhof...