Sciweavers

5184 search results - page 1037 / 1037
» The digital divide of computing
Sort
View
COMPGEOM
2010
ACM
15 years 2 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
SENSYS
2010
ACM
14 years 7 months ago
Surviving wi-fi interference in low power ZigBee networks
Frequency overlap across wireless networks with different radio technologies can cause severe interference and reduce communication reliability. The circumstances are particularly...
Chieh-Jan Mike Liang, Bodhi Priyantha, Jie Liu, An...
NAR
2011
212views Computer Vision» more  NAR 2011»
14 years 7 days ago
UKPMC: a full text article resource for the life sciences
UK PubMed Central (UKPMC) is a full-text article database that extends the functionality of the original PubMed Central (PMC) repository. The UKPMC project was launched as the fir...
Johanna R. McEntyre, Sophia Ananiadou, Stephen And...
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
12 years 12 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
« Prev « First page 1037 / 1037 Last » Next »