Sciweavers

1541 search results - page 282 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
JCP
2007
148views more  JCP 2007»
13 years 7 months ago
P3ARM-t: Privacy-Preserving Protocol for Association Rule Mining with t Collusion Resistance
— The ability to mine large volumes of distributed datasets enables more precise decision making. However, privacy concerns should be carefully addressed when mining datasets dis...
Iman Saleh, Mohamed Eltoweissy
TSMC
2002
107views more  TSMC 2002»
13 years 7 months ago
Guaranteed robust nonlinear estimation with application to robot localization
When reliable prior bounds on the acceptable errors between the data and corresponding model outputs are available, bounded-error estimation techniques make it possible to characte...
Luc Jaulin, Michel Kieffer, Eric Walter, Dominique...
CIKM
2010
Springer
13 years 6 months ago
Construction of a sentimental word dictionary
The Web has plenty of reviews, comments and reports about products, services, government policies, institutions, etc. The opinions expressed in these reviews influence how people...
Eduard C. Dragut, Clement T. Yu, A. Prasad Sistla,...
PE
2010
Springer
170views Optimization» more  PE 2010»
13 years 6 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
SPIRE
2010
Springer
13 years 6 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie