2938 search results - page 242 / 588 » On obfuscating point functions |
201
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
145
click to vote
HIS
2007
15 years 8 months ago
2007
This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficien...
197
click to vote
PERCOM
2006
ACM
2006
ACM
Incorporating Wireless Technology into Virtual Organizations Supporting the Work of Healthcare Teams
15 years 6 months ago
This study investigates how a virtual organization can be built in a distributed computing environment which includes wireless technology to support the work of a multi-disciplina...
320
click to vote
COMPGEOM
2011
ACM
14 years 10 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...
143
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
This article describes visual functions dedicated to the extraction and recognition of planar quadrangles detected from a single camera. Extraction is based on a relaxation scheme...