315 search results - page 27 / 63 » Better Approximation of Betweenness Centrality |
SISAP
2011
IEEE
13 years 20 days ago
2011
IEEE
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
SODA
2012
ACM
12 years 8 days ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
CVPR
2001
IEEE
14 years 12 months ago
2001
IEEE
The problem of binarization of gray level images acquired under nonuniform illumination is reconsidered. Yanowitz and Bruckstein proposed to use for image binarization an adaptive...
ICPR
2004
IEEE
14 years 11 months ago
2004
IEEE
We present a new method, which allows successful application of watershed transformation for images containing small objects. The method can be divided into two stages. During the...