951 search results - page 14 / 191 » On the Computation of Correctly-Rounded Sums |
119
click to vote
AAAI
2007
15 years 5 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
130
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
120
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
We investigate the problem of converting sets of sensors into strongly connected networks of sensors using multiple directional antennae. Consider a set S of n points in the plane...
147
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
154
Voted
COLING
2002
15 years 3 months ago
2002
tion. Our method was developed through the study of a corpus of abstracts written ssional abstractors. Relying on human judgment, we have evaluated indicativeness, informativeness,...