Sciweavers

212 search results - page 36 / 43
» Working with Mathematical Structures in Type Theory
Sort
View
PODC
2010
ACM
13 years 11 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
CVPR
2009
IEEE
15 years 2 months ago
Harris Corners in the Real World: A Principled Selection Criterion for Interest Points Based on Ecological Statistics
In this report, we consider whether statistical regularities in natural images might be exploited to provide an improved selection criterion for interest points. One approach that ...
Neil D. B. Bruce, Pierre Kornprobst
SPAA
2004
ACM
14 years 25 days ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
IJCV
1998
238views more  IJCV 1998»
13 years 7 months ago
Feature Detection with Automatic Scale Selection
The fact that objects in the world appear in different ways depending on the scale of observation has important implications if one aims at describing them. It shows that the not...
Tony Lindeberg
CLA
2007
13 years 8 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig