1554 search results - page 85 / 311 » Parameterized Complexity and Approximation Algorithms |
114
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We draw on the observation that the amount of heat diffusing outside of a heated body in a short period of time is proportional to its surface area, to design a simple algorithm f...
130
click to vote
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
109
click to vote
ICIP
2001
IEEE
16 years 4 months ago
2001
IEEE
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
156
click to vote
DIS
2009
Springer
15 years 9 months ago
2009
Springer
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...