Sciweavers

5316 search results - page 177 / 1064
» Which Search Problems Are Random
Sort
View
INFOCOM
2011
IEEE
14 years 7 months ago
A robust optimization approach to backup network design with random failures
—This paper presents a scheme in which a dedicated backup network is designed to provide protection from random link failures. Upon a link failure in the primary network, traffi...
Matthew Johnston, Hyang-Won Lee, Eytan Modiano
COMGEO
2004
ACM
15 years 3 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 3 months ago
On Certain Large Random Hermitian Jacobi Matrices with Applications to Wireless Communications
In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular we are inte...
Nathan Levy, Oren Somekh, Shlomo Shamai, Ofer Zeit...
JMLR
2010
145views more  JMLR 2010»
14 years 10 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever
157
Voted
ICTAI
2010
IEEE
15 years 1 months ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...