6300 search results - page 1059 / 1260 » We have it easy, but do we have it right |
175
click to vote
SSD
2007
Springer
15 years 7 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
144
click to vote
ACISP
2006
Springer
15 years 7 months ago
2006
Springer
![On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions")
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
142
click to vote
COCOS
2003
Springer
15 years 6 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
100
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
174
Voted
SAS
2001
Springer
15 years 6 months ago
2001
Springer
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...