15254 search results - page 59 / 3051 » A k |
80
Voted
GD
2005
Springer
15 years 3 months ago
2005
Springer
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
113
click to vote
SPIRE
2005
Springer
15 years 3 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
89
Voted
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the kth -ranked element of the union of the datasets, e.g. the med...
HPDC
2000
IEEE
15 years 2 months ago
2000
IEEE
The first decades of the new millennium will witness an explosive growth in the number and diversity of networked devices and portals. We foresee high degrees of mobility, hetero...