2194 search results - page 254 / 439 » Improving HLRTA*( k ) |
WWW
2008
ACM
16 years 2 months ago
2008
ACM
As wireless networks proliferate, web browsers operate in an increasingly hostile network environment. The HTTPS protocol has the potential to protect web users from network attac...
241
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major a...
106
click to vote
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
111
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
109
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...