Sciweavers

2680 search results - page 391 / 536
» The topology of the independence complex
Sort
View
CHI
2004
ACM
16 years 6 months ago
Variation in element and action: supporting simultaneous development of alternative solutions
The complexity of many problems necessitates creating and exploring multiple, alternative solutions. However, current user interfaces do not cleanly support creating alternatives ...
Michael A. Terry, Elizabeth D. Mynatt, Kumiyo Naka...
RECOMB
2003
Springer
16 years 6 months ago
Modeling dependencies in protein-DNA binding sites
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discover...
Yoseph Barash, Gal Elidan, Nir Friedman, Tommy Kap...
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 6 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
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
16 years 6 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
ICALP
2009
Springer
16 years 6 months ago
Testing Fourier Dimensionality and Sparsity
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Served...