Sciweavers

1211 search results - page 42 / 243
» Computing Manipulations of Ranking Systems
Sort
View
ISSAC
2007
Springer
111views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Numerical optimization in hybrid symbolic-numeric computation
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 ...
Lihong Zhi
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
14 years 2 months ago
Probabilistic Ranking in Uncertain Vector Spaces
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...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
ICDCS
2010
IEEE
13 years 5 months ago
Secure Ranked Keyword Search over Encrypted Cloud Data
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...
Cong Wang, Ning Cao, Jin Li, Kui Ren, Wenjing Lou
CVPR
2010
IEEE
14 years 1 months ago
Image Retrieval via Probabilistic Hypergraph Ranking
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...
Yuchi Huang, Qingshan Liu, Shaoting Zhang, Metaxas...
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 7 months ago
A field-theory motivated approach to symbolic computer algebra
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 ...
Kasper Peeters