Sciweavers

5393 search results - page 133 / 1079
» Spatial Computing with Labels
Sort
View
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
14 years 2 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
CVPR
2006
IEEE
15 years 3 days ago
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...
Marc-Antoine Drouin, Martin Trudeau, Sébast...
GRAPHICSINTERFACE
2009
13 years 7 months ago
Structural differences between two graphs through hierarchies
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
Daniel Archambault
CVPR
2007
IEEE
15 years 3 days ago
Learning Color Names from Real-World Images
Within a computer vision context color naming is the action of assigning linguistic color labels to image pixels. In general, research on color naming applies the following paradi...
Joost van de Weijer, Cordelia Schmid, Jakob J. Ver...
ECCC
2011
205views ECommerce» more  ECCC 2011»
13 years 5 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner