235 search results - page 25 / 47 » The Complexity of Separating Points in the Plane |
77
Voted
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Real scenes are full of specularities (highlights and reflections), and yet most vision algorithms ignore them. In order to capture the appearance of realistic scenes, we need to ...
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
CSL
2005
Springer
15 years 3 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
115
Voted
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
Monitoring activities using video data is an important surveillance problem. A special scenario is to learn the pattern of normal activities and detect abnormal events from a very...
COMGEO
1998
ACM
14 years 9 months ago
1998
ACM
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...