9209 search results - page 1516 / 1842 » Data Space Randomization |
135
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
123
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
178
click to vote
ICDE
2010
IEEE
15 years 12 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
136
click to vote
WSDM
2009
ACM
15 years 12 months ago
2009
ACM
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
170
click to vote
FSE
2009
Springer
15 years 12 months ago
2009
Springer
The Advanced Encryption Standard (AES) is the Federal Information Processing Standard for symmetric encryption. It is widely believed to be secure and efficient, and is therefore b...