Sciweavers

2403 search results - page 33 / 481
» Optimal Randomized RANSAC
Sort
View
MA
2010
Springer
206views Communications» more  MA 2010»
14 years 10 months ago
Quantization and clustering with Bregman divergences
 This paper deals with the quantization problem of a random variable X taking values in a separable and reexive Banach space, and with the related question of clustering independ...
Aurélie Fischer
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 3 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 5 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
CORR
2006
Springer
95views Education» more  CORR 2006»
14 years 12 months ago
Optimal Distortion-Power Tradeoffs in Gaussian Sensor Networks
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
Nan Liu, Sennur Ulukus
CVPR
2010
IEEE
15 years 7 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr