Sciweavers

969 search results - page 21 / 194
» Generalized matching from theory to application
Sort
View
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
14 years 5 days ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
CIKM
2005
Springer
14 years 1 months ago
On the estimation of frequent itemsets for data streams: theory and experiments
In this paper, we devise a method for the estimation of the true support of itemsets on data streams, with the objective to maximize one chosen criterion among {precision, recall}...
Pierre-Alain Laur, Richard Nock, Jean-Emile Sympho...
STACS
2010
Springer
14 years 2 months ago
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
TSP
2008
180views more  TSP 2008»
13 years 7 months ago
Algebraic Signal Processing Theory: Foundation and 1-D Time
This paper introduces a general and axiomatic approach to linear signal processing (SP) that we refer to as the algebraic signal processing theory (ASP). Basic to ASP is the linear...
Markus Püschel, José M. F. Moura
PAMI
2008
172views more  PAMI 2008»
13 years 8 months ago
A Theory Of Frequency Domain Invariants: Spherical Harmonic Identities for BRDF/Lighting Transfer and Image Consistency
This paper develops a theory of frequency domain invariants in computer vision. We derive novel identities using spherical harmonics, which are the angular frequency domain analog ...
Dhruv Mahajan, Ravi Ramamoorthi, Brian Curless