11345 search results - page 111 / 2269 » Foundations of Computer Science |
110
Voted
SAC
1997
ACM
15 years 6 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
145
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
Using off-the-shelf commodity workstations and PCs to build a cluster for parallel computing has become a common practice. A choice of a cost-effective cluster computing platform ...
105
Voted
IPSN
2007
Springer
15 years 8 months ago
2007
Springer
Distributed computation of Voronoi cells in sensor networks, i.e. computing the locus of points in a sensor field closest to a given sensor, is a key building block that supports...
128
Voted
OOPSLA
2005
Springer
15 years 8 months ago
2005
Springer
It is now well established that the device scaling predicted by Moore’s Law is no longer a viable option for increasing the clock frequency of future uniprocessor systems at the...
132
Voted
SIGMOD
1999
ACM
15 years 7 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...