1211 search results - page 42 / 243 » Computing Manipulations of Ranking Systems |
113
Voted
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
145
Voted
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
190
Voted
ICDCS
2010
IEEE
15 years 27 days ago
2010
IEEE
As Cloud Computing becomes prevalent, sensitive information are being increasingly centralized into the cloud. For the protection of data privacy, sensitive data has to be encrypte...
128
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper, we propose a new transductive learning framework for image retrieval, in which images are taken as vertices in a weighted hypergraph and the task of image search is...
130
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...