21324 search results - page 258 / 4265 » Making the case for computing |
147
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
138
Voted
PDCN
2004
15 years 5 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
111
click to vote
CHI
2009
ACM
16 years 4 months ago
2009
ACM
We describe our experiences in designing new media technologies in cooperation with Liberia's Truth and Reconciliation Commission. This work includes two major projects: a dy...
132
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Traditional databases have focused on the issue of reducing I/O cost as it is the bottleneck in many operations. As databases become increasingly accepted in areas such as Geograp...
166
click to vote
FSTTCS
1992
Springer
15 years 8 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...