Sciweavers

8413 search results - page 203 / 1683
» Ordering Problem Subgoals
Sort
View
MOC
2002
131views more  MOC 2002»
15 years 10 days ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
112
Voted
PAMI
2007
129views more  PAMI 2007»
15 years 5 days ago
Algorithmic Differentiation: Application to Variational Problems in Computer Vision
Abstract— Many vision problems can be formulated as minimization of appropriate energy functionals. These energy functionals are usually minimized, based on the calculus of varia...
Thomas Pock, Michael Pock, Horst Bischof
118
Voted
ATMOS
2010
162views Optimization» more  ATMOS 2010»
14 years 10 months ago
Heuristics for the Traveling Repairman Problem with Profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...
ICIP
2006
IEEE
16 years 2 months ago
Support Vector Machines for Camera Calibration Problem
This paper presents a statistical learning-based solution to the camera calibration problem in which the Support Vector Machines (SVM) are used for the estimation of the projectio...
Refaat M. Mohamed, Abdelrehim H. Ahmed, Ahmed Eid,...
ICDE
2008
IEEE
178views Database» more  ICDE 2008»
16 years 2 months ago
On the Optimal Selection of k in the k-Anonymity Problem
When disseminating data involving human subjects, researchers have to weigh in the requirements of privacy of the individuals involved in the data. A model widely used for enhancin...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...