779 search results - page 110 / 156 » Determining Time of Queries for Re-ranking Search Results |
142
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
174
click to vote
MDM
2005
Springer
15 years 11 months ago
2005
Springer
Mobile terminals (cellular phones, PDAs, palmtops etc.) emerge as a new class of small-scale, ad-hoc service providers that share data and functionality via mobile web services’...
147
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The study of biological systems demands computational support. If targeting a biological problem, the reuse of existing computational models can save time and effort. ...
183
click to vote
PKDD
2005
Springer
15 years 11 months ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
160
click to vote
LCPC
2005
Springer
15 years 11 months ago
2005
Springer
Compilers employ system models, sometimes implicitly, to make code optimization decisions. These models are analytic; they reflect their implementor’s understanding and beliefs ...