Sciweavers

958 search results - page 64 / 192
» Resolving the Micropayment Problem
Sort
View
VEE
2012
ACM
226views Virtualization» more  VEE 2012»
13 years 5 months ago
Protecting applications against TOCTTOU races by user-space caching of file metadata
Time Of Check To Time Of Use (TOCTTOU) race conditions for file accesses in user-space applications are a common problem in Unix-like systems. The mapping between filename and i...
Mathias Payer, Thomas R. Gross
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
15 years 10 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
DAC
2001
ACM
15 years 11 months ago
Watermarking Graph Partitioning Solutions
Trends in the semiconductor industry towards extensive design and code reuse motivate a need for adequate Intellectual Property Protection (IPP) schemes. We offer a new general IP...
Gregory Wolfe, Jennifer L. Wong, Miodrag Potkonjak
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
15 years 3 months ago
Minimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve...
EUROPAR
2003
Springer
15 years 3 months ago
Parallelization with Tree Skeletons
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi