7129 search results - page 339 / 1426 » Approximation Algorithms for Treewidth |
131
click to vote
ESWS
2005
Springer
15 years 10 months ago
2005
Springer
A central aspect of HCONE-merge is the mapping of ontology concepts to a hidden intermediate ontology by uncovering the intended meaning of concepts. Such a mapping is realized by ...
132
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
116
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
116
Voted
LATIN
1998
Springer
15 years 9 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
143
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— This paper presents a novel swarm approximate dynamic programming method (swarm-ADP) for parameter optimization of PSO systems, from the perspective of optimal control. Based o...