Sciweavers

2403 search results - page 341 / 481
» Optimal Randomized RANSAC
Sort
View
MOR
2010
91views more  MOR 2010»
15 years 1 months ago
Bounding Probability of Small Deviation: A Fourth Moment Approach
In this paper we study the problem of bounding the value of the probability distribution function of a random variable X at E[X] + a where a is a small quantity in comparison with...
Simai He, Jiawei Zhang, Shuzhong Zhang
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 1 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
135
Voted
SOCO
2010
Springer
15 years 1 months ago
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local searc...
Carlos García-Martínez, Manuel Lozan...
ASPDAC
2010
ACM
137views Hardware» more  ASPDAC 2010»
15 years 1 months ago
Energy and performance driven circuit design for emerging phase-change memory
Abstract--Phase-Change Random Access Memory (PRAM) has become one of the most promising emerging memory technologies, due to its attractive features such as high density, fast acce...
Dimin Niu, Yibo Chen, Xiangyu Dong, Yuan Xie
GLOBECOM
2009
IEEE
15 years 1 months ago
Coding Strategies for Bidirectional Relaying for Arbitrarily Varying Channels
In this work we study optimal coding strategies for bidirectional relaying under the condition of arbitrarily varying channels. We consider a three-node network where a relay node ...
Rafael F. Wyrembelski, Igor Bjelakovic, Holger Boc...