Sciweavers

15073 search results - page 356 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
171
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
108
Voted
ICCS
2004
Springer
15 years 10 months ago
On Balancing Delay and Cost for Routing Paths
Abstract. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The path cost of the least delay (LD) path is relatively more expe...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
122
Voted
NIPS
2003
15 years 6 months ago
Minimising Contrastive Divergence in Noisy, Mixed-mode VLSI Neurons
This paper presents VLSI circuits with continuous-valued probabilistic behaviour realized by injecting noise into each computing unit(neuron). Interconnecting the noisy neurons fo...
Hsin Chen, Patrice Fleury, Alan F. Murray
150
Voted
JLP
2007
98views more  JLP 2007»
15 years 4 months ago
Tempus fugit: How to plug it
Secret or private information may be leaked to an external attacker through the timing behaviour of the system running the untrusted code. After introducing a formalisation of thi...
Alessandra Di Pierro, Chris Hankin, Igor Siveroni,...
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
15 years 4 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu