6110 search results - page 33 / 1222 » Approximate Computing |
STOC
1999
ACM
14 years 2 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
DGCI
2009
Springer
14 years 29 days ago
2009
Springer
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
CIE
2005
Springer
14 years 3 months ago
2005
Springer
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
ICS
2010
Tsinghua U.
14 years 7 months ago
2010
Tsinghua U.