Sciweavers

2694 search results - page 180 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
UAI
2001
15 years 7 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
ICASSP
2008
IEEE
16 years 17 days ago
Robust adaptive beamforming using sequential quadratic programming
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
Aboulnasr Hassanien, Sergiy A. Vorobyov, Kon Max W...
MFCS
1994
Springer
15 years 10 months ago
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...
Frank K. H. A. Dehne, Rolf Klein
158
Voted
ICDCIT
2005
Springer
15 years 11 months ago
Merging Clustering Algorithms in Mobile Ad Hoc Networks
Abstract. Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a n...
Orhan Dagdeviren, Kayhan Erciyes, Deniz Cokuslu
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 6 months ago
Distributed Consensus over Wireless Sensor Networks Affected by Multipath Fading
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
Gesualdo Scutari, Sergio Barbarossa