Sciweavers

1387 search results - page 152 / 278
» Convexity in Discrete Space
Sort
View
PAMI
2006
440views more  PAMI 2006»
13 years 10 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
IVC
2007
98views more  IVC 2007»
13 years 10 months ago
Reversible vectorisation of 3D digital planar curves and applications
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
Isabelle Sivignon, Florent Dupont, Jean-Marc Chass...
TVCG
2008
70views more  TVCG 2008»
13 years 10 months ago
Visualizing Incomplete and Partially Ranked Data
Ranking data, which result from m raters ranking n items, are difficult to visualize due to their discrete algebraic structure, and the computational difficulties associated with t...
Paul Kidwell, Guy Lebanon, William S. Cleveland
CORR
2000
Springer
81views Education» more  CORR 2000»
13 years 10 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
MCS
2008
Springer
13 years 9 months ago
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
Achim Nonnenmacher, Christian Lubich