Sciweavers

1520 search results - page 102 / 304
» On the Error Parameter of Dispersers
Sort
View
ICPR
2004
IEEE
16 years 7 months ago
Wide Baseline Matching Through Homographic Transformation
This paper discusses the wide baseline matching problem where the camera parameters are known up to an error factor and the ground surface is considered planar. Junctions of diffe...
Rimon Elias
VTC
2008
IEEE
107views Communications» more  VTC 2008»
16 years 22 days ago
Analysis of Coded FHSS Systems with Multiple Access Interference in Nakagami Fading
Abstract—This paper studies the effect of Multiple access interference (MAI) on the performance of coded FHSS systems. This is achieved by modelling the physical channel in these...
Salam A. Zummo
AUTOMATICA
2010
122views more  AUTOMATICA 2010»
15 years 6 months ago
Bayesian system identification via Markov chain Monte Carlo techniques
The work here explores new numerical methods for supporting a Bayesian approach to parameter estimation of dynamic systems. This is primarily motivated by the goal of providing ac...
Brett Ninness, Soren J. Henriksen
CORR
2010
Springer
176views Education» more  CORR 2010»
15 years 6 months ago
A General Framework for Graph Sparsification
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
Ramesh Hariharan, Debmalya Panigrahi
CORR
2010
Springer
97views Education» more  CORR 2010»
15 years 6 months ago
A Linear-time Algorithm for Sparsification of Unweighted Graphs
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
Ramesh Hariharan, Debmalya Panigrahi