Sciweavers

1272 search results - page 94 / 255
» Approximate Parameterized Matching
Sort
View
122
Voted
SPIRE
2005
Springer
15 years 9 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
124
Voted
ACSC
2006
IEEE
15 years 9 months ago
Approximative filtering of XML documents in a publish/subscribe system
Publish/subscribe systems filter published documents and inform their subscribers about documents matching their interests. Recent systems have focussed on documents or messages ...
Annika Hinze, Yann Michel, Torsten Schlieder
202
Voted
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
14 years 3 months ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur
ICCV
2003
IEEE
16 years 5 months ago
Two-Frame Wide Baseline Matching
This paper describes a novel approach to automatically recover corresponding feature points and epipolar geometry over two wide baseline frames. Our contributions consist of sever...
Jiangjian Xiao, Mubarak Shah
DAM
2011
14 years 10 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...