10608 search results - page 1678 / 2122 » Complexity of O'Hara's Algorithm |
143
click to vote
DAC
2011
ACM
14 years 4 months ago
2011
ACM
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
173
click to vote
IACR
2011
14 years 4 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
153
click to vote
IACR
2011
14 years 4 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
157
Voted
COMGEO
2012
ACM
14 years 13 days ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
243
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...