Sciweavers

2814 search results - page 257 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
WWW
2004
ACM
16 years 1 months ago
Newsjunkie: providing personalized newsfeeds via analysis of information novelty
We present a principled methodology for filtering news stories by formal measures of information novelty, and show how the techniques can be used to custom-tailor newsfeeds based ...
Evgeniy Gabrilovich, Susan T. Dumais, Eric Horvitz
103
Voted
CRYPTO
2010
Springer
110views Cryptology» more  CRYPTO 2010»
15 years 1 months ago
An Efficient and Parallel Gaussian Sampler for Lattices
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
Chris Peikert
WSC
2007
15 years 2 months ago
Importance sampling of compounding processes
Compounding processes, also known as perpetuities, play an important role in many applications; in particular, in time series analysis and mathematical finance. Apart from some s...
Jose Blanchet, Bert Zwart
109
Voted
GLOBECOM
2007
IEEE
15 years 7 months ago
Opportunistic Access with Random Subchannel Backoff (OARSB) for OFDMA Uplink
Abstract— A distributed medium access control (MAC) algorithm for uplink OFDMA networks under the IEEE 802.16 framework is proposed and analyzed in this work. We present a simple...
Yu-Jung Chang, Feng-Tsun Chien, C. C. Jay Kuo
DMIN
2008
190views Data Mining» more  DMIN 2008»
15 years 2 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich