Sciweavers

64 search results - page 10 / 13
» cn 2000
Sort
View
CN
2000
96views more  CN 2000»
14 years 9 months ago
Focused Web searching with PDAs
The Stanford Power Browser project addresses the problems of interacting with the World-Wide Web through wirelessly connected Personal Digital Assistants (PDAs). These problems in...
Orkut Buyukkokten, Hector Garcia-Molina, Andreas P...
CN
2000
109views more  CN 2000»
14 years 9 months ago
On near-uniform URL sampling
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
MOC
1998
96views more  MOC 1998»
14 years 9 months ago
Fast solvers of integral and pseudodifferential equations on closed curves
On the basis of a fully discrete trigonometric Galerkin method and two grid iterations we propose solvers for integral and pseudodifferential equations on closed curves which solv...
Jukka Saranen, Gennadi Vainikko
MOC
1998
107views more  MOC 1998»
14 years 9 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche
ASIACRYPT
2000
Springer
15 years 2 months ago
Attack for Flash MIX
A MIX net takes a list of ciphertexts (c1, · · · , cN ) and outputs a permuted list of the plaintexts (m1, · · · , mN ) without revealing the relationship between (c1, · · ...
Masashi Mitomo, Kaoru Kurosawa