Sciweavers

1390 search results - page 252 / 278
» Computing the depth of a flat
Sort
View
TIP
2010
88views more  TIP 2010»
14 years 4 months ago
Efficient Stereoscopic Ranging via Stochastic Sampling of Match Quality
We present an efficient method that computes dense stereo correspondences by stochastically sampling match quality values. Nonexhaustive sampling facilitates the use of quality met...
Thayne Richard Coffman, Alan Conrad Bovik
SIAMREV
2011
63views more  SIAMREV 2011»
14 years 16 days ago
Discrete Symbol Calculus
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
Laurent Demanet, Lexing Ying
SPAA
2010
ACM
15 years 2 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
AFRIGRAPH
2006
ACM
15 years 3 months ago
A GPU based saliency map for high-fidelity selective rendering
The computation of high-fidelity images in real-time remains one of the key challenges for computer graphics. Recent work has shown that by understanding the human visual system,...
Peter Longhurst, Kurt Debattista, Alan Chalmers
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
15 years 1 months ago
Quantum Circuits with Mixed States
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
Dorit Aharonov, Alexei Kitaev, Noam Nisan