Sciweavers

1232 search results - page 160 / 247
» Digraphs: theory, algorithms and applications
Sort
View
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
14 years 9 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 9 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
POPL
2003
ACM
14 years 9 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
VLDB
2001
ACM
104views Database» more  VLDB 2001»
14 years 9 months ago
Global transaction support for workflow management systems: from formal specification to practical implementation
In this paper, we present an approach to global transactionmanagementinworkflowenvironments.Thetransaction mechanism is based on the well-known notion of compensation, but extended...
Paul W. P. J. Grefen, Jochem Vonk, Peter M. G. Ape...
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 9 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch