545 search results - page 40 / 109 » Simultaneous approximation by greedy algorithms |
197
click to vote
CORR
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
162
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
144
click to vote
ICPP
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...
124
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
276
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...