Sciweavers

1429 search results - page 100 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
RSCTC
2004
Springer
110views Fuzzy Logic» more  RSCTC 2004»
14 years 2 months ago
A Graded Applicability of Rules
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...
Anna Gomolinska
FGR
2008
IEEE
165views Biometrics» more  FGR 2008»
13 years 11 months ago
Efficient approximations to model-based joint tracking and recognition of continuous sign language
We propose several tracking adaptation approaches to recover from early tracking errors in sign language recognition by optimizing the obtained tracking paths w.r.t. to the hypoth...
Philippe Dreuw, Jens Forster, Thomas Deselaers, He...
ISCI
2000
84views more  ISCI 2000»
13 years 9 months ago
Automating the approximate record-matching process
Data Quality has many dimensions one of which is accuracy. Accuracy is usually compromised by errors accidentally or intensionally introduced in a database system. These errors re...
Vassilios S. Verykios, Ahmed K. Elmagarmid, Elias ...
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
14 years 4 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
SARA
2007
Springer
14 years 3 months ago
Approximate Model-Based Diagnosis Using Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...