Sciweavers

2996 search results - page 204 / 600
» Numberings and Randomness
Sort
View
TASE
2008
IEEE
15 years 6 months ago
Design of Stochastic Distribution Networks Using Lagrangian Relaxation
This paper addresses the design of single commodity stochastic distribution networks. The distribution network under consideration consists of a single supplier serving a set of re...
Guy-Aimé Tanonkou, Lyès Benyoucef, X...
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
JCT
2007
117views more  JCT 2007»
15 years 6 months ago
Large independent sets in regular graphs of large girth
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
Joseph Lauer, Nicholas C. Wormald
CORR
2002
Springer
132views Education» more  CORR 2002»
15 years 6 months ago
Robust Feature Selection by Mutual Information Distributions
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
Marco Zaffalon, Marcus Hutter
IVC
2000
113views more  IVC 2000»
15 years 6 months ago
Matching disparate views of planar surfaces using projective invariants
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...
Manolis I. A. Lourakis, Spyros T. Halkidis, Stelio...