1469 search results - page 231 / 294 » Approximate polynomial decomposition |
261
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
139
click to vote
ICIP
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper we suggest viewing images (as well as attacks on them) as a sequence of linear operators and propose novel hashing algorithms employing transforms that are based on ...
153
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
152
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
148
click to vote
LATIN
2004
Springer
15 years 10 months ago
2004
Springer
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...