Sciweavers

2168 search results - page 278 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
137
Voted
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 9 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
153
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
RECOMB
2003
Springer
16 years 3 months ago
An integrated probabilistic model for functional prediction of proteins
We develop an integrated probabilistic model to combine protein physical interactions, genetic interactions, highly correlated gene expression network, protein complex data, and d...
Minghua Deng, Ting Chen, Fengzhu Sun
132
Voted
CHI
2007
ACM
15 years 7 months ago
Social responses to virtual humans: implications for future interface design
Do human-human social interactions carry over to humanvirtual human social interactions? How does this affect future interface designers? We replicated classical tests of social i...
Catherine A. Zanbaka, Amy Catherine Ulinski, Paula...
139
Voted
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
15 years 1 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...