Sciweavers

1612 search results - page 236 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
DICTA
2003
14 years 11 months ago
A Robust Method for Estimating the Fundamental Matrix
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
C. L. Feng, Y. S. Hung
OPODIS
2004
14 years 11 months ago
Directional Versus Omnidirectional Antennas for Energy Consumption and k-Connectivity of Networks of Sensors
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
Evangelos Kranakis, Danny Krizanc, Eric Williams
AMAI
2008
Springer
14 years 10 months ago
Bayesian learning of Bayesian networks with informative priors
This paper presents and evaluates an approach to Bayesian model averaging where the models are Bayesian nets (BNs). Prior distributions are defined using stochastic logic programs...
Nicos Angelopoulos, James Cussens
DKE
2006
67views more  DKE 2006»
14 years 10 months ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...
COR
2007
95views more  COR 2007»
14 years 9 months ago
Inventory routing with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song