1068 search results - page 60 / 214 » Factorization as a Rank 1 Problem |
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
100
click to vote
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
IPL
2008
14 years 9 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
101
click to vote
COMPGEOM
1997
ACM
15 years 2 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...