Sciweavers

6365 search results - page 57 / 1273
» Fast Local Computation Algorithms
Sort
View
102
Voted
SAINT
2008
IEEE
15 years 7 months ago
Local Production, Local Consumption Storage Economics for Peer-to-Peer Systems
Autonomy of peer-to-peer (P2P) systems requires some form of economies. Forwardable storage claims of Samsara[1] can define a common value in computer networks, and possibly be a...
Kenji Saito, Eiichi Morino
70
Voted
ACL
2004
15 years 2 months ago
Computing Locally Coherent Discourses
We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measur...
Ernst Althaus, Nikiforos Karamanis, Alexander Koll...
102
Voted
BMCBI
2007
138views more  BMCBI 2007»
15 years 21 days ago
Fast computation of distance estimators
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
Isaac Elias, Jens Lagergren
86
Voted
CCS
1998
ACM
15 years 4 months ago
A Security Architecture for Computational Grids
State-of-the-art and emerging scientific applications require fast access to large quantities of data and commensurately fast computational resources. Both resources and data are ...
Ian T. Foster, Carl Kesselman, Gene Tsudik, Steven...
98
Voted
DIS
2007
Springer
15 years 6 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki