Sciweavers

14190 search results - page 2687 / 2838
» computing 2008
Sort
View
C5
2008
IEEE
15 years 9 months ago
Remote Opportunities: A Rethinking and Retooling
Introducing technology as a sustainable means of creating, connecting, and collaborating introduces the need to carefully consider subtle aspects of deployment strategies and supp...
Yagiz Onat Yazir, Katherine Gunion, Christopher Pe...
125
Voted
DSN
2008
IEEE
15 years 9 months ago
Enhancing data availability in disk drives through background activities
Latent sector errors in disk drives affect only a few data sectors. They occur silently and are detected only when the affected area is accessed again. If a latent error is detect...
Ningfang Mi, Alma Riska, Evgenia Smirni, Erik Ried...
131
Voted
FOCS
2008
IEEE
15 years 9 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
FOCS
2008
IEEE
15 years 9 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
159
Voted
FOCS
2008
IEEE
15 years 9 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
« Prev « First page 2687 / 2838 Last » Next »