Sciweavers

5105 search results - page 80 / 1021
» Approximate Structural Consistency
Sort
View
ICPR
2000
IEEE
15 years 4 months ago
Two-Stage Computational Cost Reduction Algorithm Based on Mahalanobis Distance Approximations
For many pattern recognition methods, high recognition accuracy is obtained at very high expense of computational cost. In this paper, a new algorithm that reduces the computation...
Fang Sun, Shinichiro Omachi, Nei Kato, Hirotomo As...
AAAI
2007
15 years 2 months ago
Approximate Query Answering in Locally Closed Databases
The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomp...
Alvaro Cortés-Calabuig, Marc Denecker, Ofer...
IJCAI
2003
15 years 1 months ago
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
Carmel Domshlak, Francesca Rossi, Kristen Brent Ve...
WSCG
2003
165views more  WSCG 2003»
15 years 1 months ago
A Shape Constrained Curve Approximation Method for Styling Surfaces Modeling
The problem of styling surfaces modeling is tackled. An approach based on section curves fairing is chosen. The concept of template curves is developed for approximating profiles ...
Yves Mineur
DAM
2008
131views more  DAM 2008»
14 years 12 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...