Sciweavers

1679 search results - page 307 / 336
» Strong order equivalence
Sort
View
POPL
2008
ACM
16 years 3 days ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 3 days ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
15 years 12 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 9 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
EUROSYS
2006
ACM
15 years 9 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...