3415 search results - page 648 / 683 » Lower Bounds for Kernelizations |
ICDM
2005
IEEE
14 years 3 months ago
2005
IEEE
Frequent itemset mining is a core data mining operation and has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major...
INFOCOM
2005
IEEE
14 years 3 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
PODC
2005
ACM
14 years 3 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
SPAA
2005
ACM
14 years 3 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
CIKM
2005
Springer
14 years 3 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...