1920 search results - page 170 / 384 » The Complexity of the A B C Problem |
223
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
176
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
163
click to vote
EUROCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...
156
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
170
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...