699 search results - page 11 / 140 » Generalized Distance Functions in the Theory of Computation |
PKC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
105
click to vote
EDBT
2011
ACM
14 years 1 months ago
2011
ACM
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
DIALM
2003
ACM
15 years 2 months ago
2003
ACM
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
120
click to vote
SIGECOM
2011
ACM
14 years 14 days ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
118
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper, we introduce a novel algorithm to solve
global shape registration problems. We use gray-scale “images”
to represent source shapes, and propose a novel twocompo...