Sciweavers

2136 search results - page 104 / 428
» Improving on Expectation Propagation
Sort
View
JACM
2010
135views more  JACM 2010»
13 years 8 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
FOCS
2007
IEEE
14 years 4 months ago
Round Complexity of Authenticated Broadcast with a Dishonest Majority
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafai...
STOC
1993
ACM
87views Algorithms» more  STOC 1993»
14 years 2 months ago
How to use expert advice
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
Nicolò Cesa-Bianchi, Yoav Freund, David P. ...
ALGOSENSORS
2009
Springer
14 years 1 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
EMNLP
2007
13 years 11 months ago
Scalable Term Selection for Text Categorization
In text categorization, term selection is an important step for the sake of both categorization accuracy and computational efficiency. Different dimensionalities are expected und...
Jingyang Li, Maosong Sun