1208 search results - page 48 / 242 » Uniform eventown problems |
140
click to vote
FUN
2010
Springer
15 years 8 months ago
2010
Springer
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
131
click to vote
TIP
1998
15 years 3 months ago
1998
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...
121
click to vote
ICDT
2005
ACM
15 years 9 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
187
Voted
SIAMCOMP
2011
14 years 11 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
148
Voted
CCGRID
2006
IEEE
15 years 6 months ago
2006
IEEE
In the Biodiversity World (BDW) project we have created a flexible and extensible Web Services-based Grid environment for biodiversity researchers to solve problems in biodiversity...