Sciweavers

534 search results - page 25 / 107
» Approximation of Indistinct Concepts
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
ECAI
2008
Springer
13 years 9 months ago
Approximate structure preserving semantic matching
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
SOCO
1998
Springer
13 years 7 months ago
Approximate analysis of binary topological relations between geographic regions with indeterminate boundaries
The development of formal models of spatial relations is a topic of great importance in spatial reasoning, geographic information systems (GIS) and computer vision, and has gained ...
F. Benjamin Zhan
MICS
2010
137views more  MICS 2010»
13 years 6 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun