Sciweavers

419 search results - page 41 / 84
» Designing and Implementing a General Purpose Halfedge Data S...
Sort
View
SAC
2004
ACM
14 years 1 months ago
Self-maintained distributed tuples for field-based coordination in dynamic networks
Field-based coordination is a very promising approach for a wide range of application scenarios in modern dynamic networks. To implement such an approach, one can rely on distribu...
Marco Mamei, Franco Zambonelli
ASPLOS
2009
ACM
14 years 8 months ago
Complete information flow tracking from the gates up
For many mission-critical tasks, tight guarantees on the flow of information are desirable, for example, when handling important cryptographic keys or sensitive financial data. We...
Mohit Tiwari, Hassan M. G. Wassel, Bita Mazloom, S...
GIS
2004
ACM
14 years 8 months ago
Object-relational management of complex geographical objects
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
COMPGEOM
2004
ACM
14 years 1 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 8 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan