9997 search results - page 425 / 2000 » The case for crowd computing |
174
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
We compute the number of rhombus tilings of a hexagon with sides n, n, N, n, n, N, where two triangles on the symmetry axis touching in one vertex are removed. The case of the comm...
177
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
This paper explores the limitations of one technique for modelling computer-based systems with evolving requirements. A case study is introduced which highlights the importance of...
163
click to vote
ORL
2007
15 years 6 months ago
2007
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous resul...
182
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...
178
click to vote
ACL
2010
15 years 4 months ago
2010
We investigate a recently proposed Bayesian adaptation method for building style-adapted maximum entropy language models for speech recognition, given a large corpus of written la...