Sciweavers

6251 search results - page 111 / 1251
» Randomness, Computability, and Density
Sort
View
ICARCV
2002
IEEE
110views Robotics» more  ICARCV 2002»
15 years 5 months ago
A novel robust method for large numbers of gross errors
In computer vision tasks, it frequently happens that gross noise occupies the absolute majority of the data. Most robust estimators can tolerate no more than 50% gross errors. In ...
Hanzi Wang, David Suter
98
Voted
FOCS
2008
IEEE
15 years 7 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow

Lecture Notes
1858views
16 years 10 months ago
Computational Physics
Easy to follow lecture notes on Computational Physics.
Alexander L. Godunov
92
Voted
SIAMAM
2008
79views more  SIAMAM 2008»
15 years 18 days ago
Transport-Based Imaging in Random Media
This paper generalizes well-established derivations of the radiative transfer equation from first principles to model the energy density of time-dependent and monochromatic high f...
Guillaume Bal, Kui Ren
118
Voted
CPC
1999
105views more  CPC 1999»
15 years 10 days ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill