6110 search results - page 11 / 1222 » Approximate Computing |
SAC
2010
ACM
13 years 8 months ago
2010
ACM
ARITH
2009
IEEE
14 years 4 months ago
2009
IEEE
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
FOCS
1994
IEEE
14 years 1 months ago
1994
IEEE
ICCSA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...