2252 search results - page 255 / 451 » Lower Bounds for Dynamic Algorithms |
147
click to vote
ICDM
2005
IEEE
16 years 3 days 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...
147
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
169
click to vote
AAAI
2010
15 years 8 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
176
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
269
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...