2168 search results - page 335 / 434 » Randomized Algorithms and Complexity Theory |
130
click to vote
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
168
click to vote
PODS
2012
ACM
13 years 5 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
136
click to vote
ASUNAM
2010
IEEE
15 years 4 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
116
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
145
click to vote
SISAP
2009
IEEE
15 years 10 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 ...