9520 search results - page 1861 / 1904 » or 2011 |
107
click to vote
APPROX
2011
Springer
13 years 12 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...
103
click to vote
APPROX
2011
Springer
13 years 12 months ago
2011
Springer
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
121
click to vote
APPROX
2011
Springer
13 years 12 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
108
click to vote
APVIS
2011
13 years 12 months ago
2011
Robust analysis of vector fields has been established as an important tool for deriving insights from the complex systems these fields model. Many analysis techniques rely on co...
134
click to vote
ASAP
2011
IEEE
13 years 11 months ago
2011
IEEE
—The domain of vision and navigation often includes applications for feature tracking as well as simultaneous localization and mapping (SLAM). As these problems require computati...