4377 search results - page 348 / 876 » Mass problems and randomness |
148
click to vote
INFOCOM
2005
IEEE
16 years 12 days ago
2005
IEEE
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
181
click to vote
ACMSE
2005
ACM
16 years 11 days ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
178
click to vote
IJCNLP
2005
Springer
16 years 9 days ago
2005
Springer
The current work applies Conditional Random Fields to the problem of temporal reference mapping from Chinese text to English text. The learning algorithm utilizes a moderate number...
170
click to vote
ISSAC
2005
Springer
16 years 9 days ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
192
click to vote
WDAG
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...