239 search results - page 30 / 48 » Localized Upper and Lower Bounds for Some Estimation Problem... |
ALGORITHMICA
2008
14 years 12 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
103
click to vote
TMC
2010
14 years 10 months ago
2010
—Secure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in mobile wireless ad hoc and sensor networks. Despite significa...
101
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
106
click to vote
APPROX
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...