Sciweavers

322 search results - page 60 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Shape Matching and Object Recognition Using Low Distortion Correspondences
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
Alexander C. Berg, Tamara L. Berg, Jitendra Malik
ECCV
2002
Springer
14 years 9 months ago
An Affine Invariant Interest Point Detector
This paper presents a novel approach for detecting affine invariant interest points. Our method can deal with significant affine transformations including large scale changes. Such...
Krystian Mikolajczyk, Cordelia Schmid
ANOR
2011
175views more  ANOR 2011»
13 years 2 months ago
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
Fred Glover, Lawrence H. Cox, Rahul Patil, James P...
CCR
2005
76views more  CCR 2005»
13 years 7 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan
DCOSS
2011
Springer
12 years 7 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun