Sciweavers

783 search results - page 65 / 157
» Communities from seed sets
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 10 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 6 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
SI3D
1992
ACM
15 years 10 months ago
Volume Seedlings
Recent advances in software and hardware technology have made direct ray-traced volume rendering of 3-d scalar data a feasible and effective method for imaging of the data's ...
Michael F. Cohen, James S. Painter, Mihir Mehta, K...
WWW
2002
ACM
16 years 7 months ago
OCTOPUS: aggressive search of multi-modality data using multifaceted knowledge base
An important trend in Web information processing is the support of multimedia retrieval. However, the most prevailing paradigm for multimedia retrieval, content-based retrieval (C...
Jun Yang 0003, Qing Li, Yueting Zhuang
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
16 years 1 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu