100 search results - page 15 / 20 » A distance-labelling problem for hypercubes |
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
113
click to vote
SPAA
1994
ACM
15 years 1 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
105
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
PODS
2004
ACM
15 years 10 months ago
2004
ACM
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...