829 search results - page 141 / 166 » Distance domination-critical graphs |
111
click to vote
KDD
2007
ACM
16 years 6 days ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
105
click to vote
SISAP
2009
IEEE
15 years 6 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
128
click to vote
ALGOSENSORS
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
123
click to vote
CIVR
2007
Springer
15 years 6 months ago
2007
Springer
In the present study, an efficient strategy for retrieving texture images from large texture databases is introduced and studied within a distributional-statistical framework. Our...
116
click to vote
ICPP
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...