Sciweavers

5153 search results - page 464 / 1031
» Introduction to Randomized Algorithms
Sort
View
NETWORKS
2008
15 years 6 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
147
Voted
JC
2007
119views more  JC 2007»
15 years 6 months ago
Deterministic constructions of compressed sensing matrices
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performan...
Ronald A. DeVore
TMC
2010
139views more  TMC 2010»
15 years 4 months ago
Optimize Storage Placement in Sensor Networks
—Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introdu...
Bo Sheng, Qun Li, Weizhen Mao
BMVC
2010
15 years 4 months ago
Deterministic Sample Consensus with Multiple Match Hypotheses
RANSAC (Random Sample Consensus) is a popular and effective technique for estimating model parameters in the presence of outliers. Efficient algorithms are necessary for both fram...
Paul McIlroy, Edward Rosten, Simon Taylor, Tom Dru...
IGARSS
2009
15 years 4 months ago
Hierarchical Segmentation of Polarimetric SAR Images using Heterogeneous Clutter Models
In this paper, heterogeneous clutter models are introduced to describe Polarimetric Synthetic Aperture Radar (PolSAR) data. Based on the Spherically Invariant Random Vectors (SIRV...
Lionel Bombrun, Jean-Marie Beaulieu, Gabriel Vasil...