9871 search results - page 309 / 1975 » On the Structure of Low Sets |
187
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
141
click to vote
IBMRD
2006
15 years 6 months ago
2006
Because they are based on large content-addressable memories, load-store queues (LSQ) present implementation challenges in superscalar processors, especially as issue width and nu...
285
click to vote
FPL
2011
Springer
14 years 6 months ago
2011
Springer
In this paper two compact hardware structures for the computation of the CLEFIA encryption algorithm are presented. One structure based on the existing state of the art and a nove...
174
click to vote
ATAL
2005
Springer
16 years 7 days ago
2005
Springer
This paper focuses on the problem of generating coalition structures for task allocation via coalition formation. It provides a unified formal framework for constructing those co...
189
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Dynamic programming (DP) has been a useful tool for a variety of computer vision problems. However its application is usually limited to problems with a one dimensional or low tre...