Sciweavers

3570 search results - page 4 / 714
» Using the Small-World Model to Improve Freenet Performance
Sort
View
ACL
2012
12 years 12 months ago
Improving the IBM Alignment Models Using Variational Bayes
Bayesian approaches have been shown to reduce the amount of overfitting that occurs when running the EM algorithm, by placing prior probabilities on the model parameters. We appl...
Darcey Riley, Daniel Gildea
124
Voted
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
13 years 9 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
Josep Díaz, Alberto Marchetti-Spaccamela, D...
83
Voted
SPIN
2010
Springer
14 years 8 months ago
Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance
In our earlier work we have proposed using the declarative language DecSerFlow for modeling, analysis and enactment of processes in autonomous web services. DecSerFlow uses constra...
Maja Pesic, Dragan Bosnacki, Wil M. P. van der Aal...
COLING
2010
14 years 4 months ago
Using Web-scale N-grams to Improve Base NP Parsing Performance
We use web-scale N-grams in a base NP parser that correctly analyzes 95.4% of the base NPs in natural text. Web-scale data improves performance. That is, there is no data like mor...
Emily Pitler, Shane Bergsma, Dekang Lin, Kenneth W...
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 3 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud