53327 search results - page 10411 / 10666 » or 2007 |
210
click to vote
WADS
2007
Springer
16 years 7 days ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
176
click to vote
WADS
2007
Springer
16 years 7 days ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
155
Voted
WAIM
2007
Springer
16 years 7 days ago
2007
Springer
Nowadays, as there is an increasing need to integrate the DBMS (for structured data) with Information Retrieval (IR) features (for unstructured data), DB-IR integration becomes one...
160
click to vote
WAIM
2007
Springer
16 years 7 days ago
2007
Springer
The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pag...
145
Voted
WAOA
2007
Springer
16 years 7 days ago
2007
Springer
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...