779 search results - page 111 / 156 » Determining Time of Queries for Re-ranking Search Results |
152
click to vote
HPDC
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
165
click to vote
DEXA
2003
Springer
15 years 11 months ago
2003
Springer
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
145
click to vote
ICCV
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper considers the problem of self-calibration of a camera from an image sequence in the case where the camera's internal parameters (most notably focal length) may cha...
176
click to vote
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
162
click to vote
LKR
2008
15 years 7 months ago
2008
Abstract. For clustering problems, many studies use just MAP assignments to show clustering results instead of using whole samples from a MCMC sampler. This is because it is not st...