Sciweavers

2311 search results - page 217 / 463
» Robustness and Generalization
Sort
View
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 10 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
NETCOOP
2007
Springer
16 years 21 days ago
A Network Formation Game Approach to Study BitTorrent Tit-for-Tat
The Tit-for-Tat strategy implemented in BitTorrent (BT) clients is generally considered robust to selfish behaviours. The authors of [1] support this belief studying how Tit-for-T...
Giovanni Neglia, Giuseppe Lo Presti, Honggang Zhan...
CVPR
2010
IEEE
15 years 6 months ago
Illumination compensation based change detection using order consistency
We present a change detection method resistant to global and local illumination variations for use in visual surveillance scenarios. Approaches designed thus far for robustness to...
Vasu Parameswaran, Maneesh Singh, Visvanathan Rame...
CVPR
2004
IEEE
16 years 8 months ago
Efficient Tracking with the Bounded Hough Transform
The Bounded Hough Transform is introduced to track objects in a sequence of sparse range images. The method is based upon a variation of the General Hough Transform that exploits ...
Michael A. Greenspan, Limin Shang, Piotr Jasiobedz...
DAGSTUHL
2003
15 years 8 months ago
Reliable Distance and Intersection Computation Using Finite Precision Geometry
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
Katja Bühler, Eva Dyllong, Wolfram Luther