Sciweavers

711 search results - page 85 / 143
» Matching Hierarchical Structures Using Association Graphs
Sort
View
WG
2005
Springer
14 years 1 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
IPPS
1996
IEEE
13 years 12 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
DAC
1996
ACM
13 years 12 months ago
Pseudorandom-Pattern Test Resistance in High-Performance DSP Datapaths
The testability of basic DSP datapath structures using pseudorandom built-in self-test techniques is examined. The addition of variance mismatched signals is identified as a testi...
Laurence Goodby, Alex Orailoglu
MM
2006
ACM
119views Multimedia» more  MM 2006»
14 years 1 months ago
Model generation for video-based object recognition
This paper presents a novel approach to object recognition involving a sparse 2D model and matching using video. The model is generated on the basis of geometry and image measurab...
Humera Noor, Shahid H. Mirza, Yaser Sheikh, Amit J...
CCCG
2008
13 years 9 months ago
Computational Balloon Twisting: The Theory of Balloon Polyhedra
This paper builds a general mathematical and algorithmic theory for balloon-twisting structures, from balloon animals to balloon polyhedra, by modeling their underlying graphs (ed...
Erik D. Demaine, Martin L. Demaine, Vi Hart