Sciweavers

8825 search results - page 15 / 1765
» All for one or one for all
Sort
View
115
Voted
CLUSTER
2006
IEEE
15 years 4 months ago
Modeling Network Contention Effects on All-to-All Operations
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient complete exchange ...
Luiz Angelo Steffenel
89
Voted
MOC
1998
92views more  MOC 1998»
15 years 11 days ago
Perturbing polynomials with all their roots on the unit circle
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...
90
Voted
ACL
2010
14 years 10 months ago
Combining Orthogonal Monolingual and Multilingual Sources of Evidence for All Words WSD
Word Sense Disambiguation remains one of the most complex problems facing computational linguists to date. In this paper we present a system that combines evidence from a monoling...
Weiwei Guo, Mona Diab
81
Voted
HICSS
2005
IEEE
158views Biometrics» more  HICSS 2005»
15 years 6 months ago
The Mysteries of Open Source Software: Black and White and Red All Over?
Open Source Software (OSS) has attracted enormous media and research attention since the term was coined in February 1998. The concept itself is founded on the paradoxical premise...
Brian Fitzgerald, Pär J. Ågerfalk
115
Voted
MST
2010
98views more  MST 2010»
14 years 11 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...