458 search results - page 65 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
SEMWEB
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of SPARQL query optimization on top of distributed hash tables. Existing works on SPARQL query processing in such environments have never been implemented in a...
ISCAS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
GLOBECOM
2007
IEEE
13 years 8 months ago
2007
IEEE
— In this paper, we introduce a network multicast problem called the alternating multicast problem. In this problem, there is more than one multicast on the network, but only one...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Motion blur can degrade the quality of images and is considered a nuisance for computer vision problems. In this paper, we show that motion blur can in-fact be used for increasing...