1439 search results - page 152 / 288 » Fast approximation of centrality |
114
click to vote
BTW
2007
Springer
15 years 4 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
106
Voted
ICIP
2009
IEEE
16 years 1 months ago
2009
IEEE
We propose a fully automated variation of the GrabCut technique for segmenting comparatively simple images with little variation in background colour and relatively high contrast ...
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
90
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
We address the problem of analyzing programs such as J2ME midlets for mobile devices, where a central correctness requirement concerns confidentiality of data that the user wants t...
86
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...