Sciweavers

13500 search results - page 220 / 2700
» Improved analysis of D
Sort
View
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 7 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
ICSE
2003
IEEE-ACM
16 years 6 months ago
Improving Test Suites via Operational Abstraction
g Test Suites via Operational Abstraction Michael Harder Jeff Mellen Michael D. Ernst MIT Lab for Computer Science 200 Technology Square Cambridge, MA 02139 USA {mharder,jeffm,mern...
Michael Harder, Jeff Mellen, Michael D. Ernst
SOSP
2007
ACM
16 years 3 months ago
Improving file system reliability with I/O shepherding
We introduce a new reliability infrastructure for file systems called I/O shepherding. I/O shepherding allows a file system developer to craft nuanced reliability policies to de...
Haryadi S. Gunawi, Vijayan Prabhakaran, Swetha Kri...
OOPSLA
2007
Springer
16 years 20 days ago
Improving quality together
One recent change in software development is developers starting to take responsibility for the quality of their work by writing and executing automated tests. As with any new act...
David G. Jones, Gordon R. Cameron
ISMAR
2006
IEEE
16 years 16 days ago
Using aerial photographs for improved mobile AR annotation
We present a mobile augmented reality system for outdoor annotation of the real world. To reduce user burden, we use aerial photographs in addition to the wearable system’s usua...
Jason Wither, Stephen DiVerdi, Tobias Höllere...