2168 search results - page 144 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
126
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
148
click to vote
LCPC
2001
Springer
15 years 8 months ago
2001
Springer
This paper discusses the potential benefits of applicationspecific power management through remote task execution. Power management is crucial for mobile devices that have to re...
124
click to vote
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
151
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
151
click to vote
VRST
2003
ACM
15 years 9 months ago
2003
ACM
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...