4894 search results - page 322 / 979 » The Guarding Problem - Complexity and Approximation |
182
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
182
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
182
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
170
click to vote
SIGCOMM
1999
ACM
15 years 11 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
205
click to vote
SODA
1993
ACM
15 years 8 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...