2168 search results - page 308 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
153
Voted
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
141
click to vote
SC
1995
ACM
15 years 7 months ago
1995
ACM
Rapid increases in computing and communication performance are exacerbating the long-standing problem of performance-limited input/output. Indeed, for many otherwise scalable para...
163
click to vote
COMGEO
2007
ACM
15 years 4 months ago
2007
ACM
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
140
Voted
IMC
2010
ACM
15 years 1 months ago
2010
ACM
Prior studies of Internet traffic have considered traffic at different resolutions and time scales: packets and flows for hours or days, aggregate packet statistics for days or we...
126
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Heterogeneous distributed environments or grid environments provide large computing resources for the execution of large scientific applications. The effective use of those plat...