5169 search results - page 660 / 1034 » Locality approximation using time |
183
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
160
click to vote
SIGMETRICS
1998
ACM
15 years 10 months ago
1998
ACM
We demonstrate that high-level le system events exhibit selfsimilar behaviour, but only for short-term time scales of approximately under a day. We do so through the analysis of f...
173
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
177
click to vote
SASO
2009
IEEE
16 years 1 months ago
2009
IEEE
—Large-scale agent-based systems are required to self-optimize towards multiple, potentially conflicting, policies of varying spatial and temporal scope. As a result, not all ag...
172
click to vote
MM
2004
ACM
15 years 11 months ago
2004
ACM
Given time and location information about digital photographs we can automatically generate an abundance of related contextual metadata, using off-the-shelf and Web-based data so...