986 search results - page 132 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
105
Voted
SWAT
1992
Springer
15 years 7 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
147
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
104
Voted
TIP
2010
15 years 2 months ago
2010
—Image denoising has been a well studied problem in the field of image processing. Yet researchers continue to focus attention on it to better the current state-of-the-art. Rece...
123
Voted
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
129
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...