4047 search results - page 180 / 810 » The Discrete Basis Problem |
124
click to vote
MVA
2008
15 years 3 months ago
2008
The problem of automated visual surveillance has spawned a lively research area, with 2005 seeing three conferences or workshops and special issues of two major journals devoted to...
147
click to vote
MOC
2011
14 years 10 months ago
2011
The simplest pair of spaces P1/P0 is made inf-sup stable for the mixed form of the Darcy equation. The key ingredient is enhance the finite element spaces inside a PetrovGalerkin ...
115
Voted
NIPS
1992
15 years 4 months ago
1992
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Given a set of n points in the plane and a collection of k halving lines of P ℓ1, . . . , ℓk indexed according to the increasing order of their slopes, we denote by d(ℓj, ...
99
Voted
DATE
2006
IEEE
15 years 9 months ago
2006
IEEE
Recently, the interest about the Tate pairing over binary fields has decreased due to the existence of efficient attacks to the discrete logarithm problem in the subgroups of su...