Sciweavers

3571 search results - page 281 / 715
» Cohen and Set Theory
Sort
View
PODS
2008
ACM
211views Database» more  PODS 2008»
16 years 6 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
185
Voted
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 5 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
CHI
2007
ACM
16 years 7 months ago
Research through design as a method for interaction design research in HCI
For years the HCI community has struggled to integrate design in research and practice. While design has gained a strong foothold in practice, it has had much less impact on the H...
John Zimmerman, Jodi Forlizzi, Shelley Evenson
POPL
2006
ACM
16 years 7 months ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 7 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein