144 search results - page 9 / 29 » Sampling Techniques for Large, Dynamic Graphs |
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
WAW
2004
Springer
15 years 2 months ago
2004
Springer
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Current state-of-the-art image-based scene reconstruction
techniques are capable of generating high-fidelity 3D
models when used under controlled capture conditions.
However, th...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Learning to cope with domain change has been known
as a challenging problem in many real-world applications.
This paper proposes a novel and efficient approach, named
domain ada...