1066 search results - page 122 / 214 » Computing Private Set Operations with Linear Complexities |
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
SIGGRAPH
1989
ACM
15 years 1 months ago
1989
ACM
As shown in 1982, Julia sets of quadratic functions as well as many other deterministic fractals exist in spaces of higher dimensionality than the complex plane. Originally a boun...
JC
2002
14 years 9 months ago
2002
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
106
click to vote
IWCIA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
ICWS
2008
IEEE
14 years 11 months ago
2008
IEEE
Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an organization's us...