5153 search results - page 479 / 1031 » Introduction to Randomized Algorithms |
145
click to vote
PVLDB
2008
15 years 5 months ago
2008
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...
158
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
—In energy harvesting communication systems, an exogenous recharge process supplies energy for the data transmission and arriving energy can be buffered in a battery before consu...
163
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
183
click to vote
MST
2010
15 years 4 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
193
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...