Sciweavers

1806 search results - page 109 / 362
» Randomness and halting probabilities
Sort
View
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
13 years 8 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
CDC
2009
IEEE
139views Control Systems» more  CDC 2009»
13 years 6 months ago
Synchronization stability of complex dynamical networks with probabilistic time-varying delays
Abstract-- A kind of complex dynamical networks with timevarying coupling delays is proposed. By some transformation, the synchronization problem of the complex networks is transfe...
Hongjie Li, Dong Yue, Zhou Gu
CVPR
2012
IEEE
11 years 11 months ago
City scale geo-spatial trajectory estimation of a moving camera
This paper presents a novel method for estimating the geospatial trajectory of a moving camera with unknown intrinsic parameters, in a city-scale urban environment. The proposed m...
Gonzalo Vaca-Castano, Amir Roshan Zamir, Mubarak S...
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 9 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Bruno F. Ribeiro, Donald F. Towsley
CVPR
2009
IEEE
15 years 4 months ago
P-Brush: Continuous Valued MRFs with Normed Pairwise Distributions for Image Segmentation
Interactive image segmentation traditionally involves the use of algorithms such as Graph Cuts or Random Walker. Common concerns with using Graph Cuts are metrication artifacts ...
Dheeraj Singaraju, Leo Grady, René Vidal