Sciweavers

5183 search results - page 331 / 1037
» The Complexity of Distributions
Sort
View
ICPP
1992
IEEE
15 years 10 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
EMNLP
2010
15 years 4 months ago
Simple Type-Level Unsupervised POS Tagging
Part-of-speech (POS) tag distributions are known to exhibit sparsity -- a word is likely to take a single predominant tag in a corpus. Recent research has demonstrated that incorp...
Yoong Keok Lee, Aria Haghighi, Regina Barzilay
PODC
2005
ACM
16 years 7 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
IPPS
2006
IEEE
16 years 21 days ago
Tree-based overlay networks for scalable applications
The increasing availability of high-performance computing systems with thousands, tens of thousands, and even hundreds of thousands of computational nodes is driving the demand fo...
Dorian C. Arnold, G. D. Pack, Barton P. Miller
COMPLEX
2009
Springer
15 years 10 months ago
Capturing Internet Traffic Dynamics through Graph Distances
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...
Steve Uhlig, Bingjie Fu, Almerima Jamakovic