1632 search results - page 176 / 327 » Sublinear Time Algorithms for Metric Space Problems |
126
click to vote
WEBI
2009
Springer
15 years 11 months ago
2009
Springer
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
155
click to vote
TCS
2008
15 years 4 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
168
click to vote
DAM
1999
15 years 3 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
116
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of ...
121
click to vote
DAWAK
1999
Springer
15 years 8 months ago
1999
Springer
A data warehouse DW can be seen as a set of materialized views de ned over remote base relations. When a query is posed, it is evaluated locally, using the materialized views, wi...