Sciweavers

1145 search results - page 206 / 229
» Discrete Green's Functions
Sort
View
WWW
2005
ACM
14 years 10 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 10 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 10 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
14 years 7 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
ICIP
2008
IEEE
14 years 4 months ago
Hardware-friendly descreening
Conventional electrophotographic printers tend to produce Moir´e artifacts when used for printing images scanned from printed material such as books and magazines. We propose a n...
Hasib Siddiqui, Mireille Boutin, Charles A. Bouman