Sciweavers

1424 search results - page 248 / 285
» Improving on Version Stamps
Sort
View
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 9 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 9 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
14 years 9 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
ICSE
2005
IEEE-ACM
14 years 9 months ago
Verification and change-impact analysis of access-control policies
Sensitive data are increasingly available on-line through the Web and other distributed protocols. This heightens the need to carefully control access to data. Control means not o...
Kathi Fisler, Shriram Krishnamurthi, Leo A. Meyero...
SOSP
2005
ACM
14 years 6 months ago
Mondrix: memory isolation for linux using mondriaan memory protection
This paper presents the design and an evaluation of Mondrix, a version of the Linux kernel with Mondriaan Memory Protection (MMP). MMP is a combination of hardware and software th...
Emmett Witchel, Junghwan Rhee, Krste Asanovic