Sciweavers

1763 search results - page 52 / 353
» Dependent random choice
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
MDAI
2009
Springer
14 years 3 months ago
Using Conditional Random Fields for Decision-Theoretic Planning
We propose a means of extending Conditional Random Field modeling to decision-theoretic planning where valuation is dependent upon fullyobservable factors. Representation is discu...
Paul A. Ardis, Christopher M. Brown
CISS
2008
IEEE
14 years 3 months ago
Random access over multiple access channels: A queuing perspective
—This paper investigates a slotted random access system where packet capture is modeled using communication theoretic techniques. It is shown that the optimum rates and attempt p...
Shreeshankar Bodas, Sriram Vishwanath, Vijay Subra...
ICIP
2004
IEEE
14 years 10 months ago
Rate-distortion analysis of random access for compressed light fields
Image-based rendering data sets, such as light fields, require efficient compression due to their large data size, but also easy random access when rendering from the data set. Ef...
Prashant Ramanathan, Bernd Girod
CPC
2008
135views more  CPC 2008»
13 years 9 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs