Sciweavers

611 search results - page 80 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
14 years 9 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
COMPGEOM
2004
ACM
14 years 2 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
CVPR
2004
IEEE
14 years 11 months ago
On the Distribution of Saliency
The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms typically mark edge-points with some s...
Alexander Berengolts, Michael Lindenbaum
PPOPP
2005
ACM
14 years 2 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
BIRTHDAY
2004
Springer
14 years 2 months ago
On the Formal Modelling of Trust in Reputation-Based Systems
In a reputation-based trust management system an entity’s behaviour determines its reputation which in turn affects other entities interaction with it. We present a mathematical...
Mogens Nielsen, Karl Krukow