6274 search results - page 498 / 1255 » From query complexity to computational complexity |
173
click to vote
COMPGEOM
2010
ACM
16 years 1 days ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
193
click to vote
IWVF
2001
Springer
15 years 11 months ago
2001
Springer
The usefulness of the 3D Medial Axis (MA) is dependent on both the availability of accurate and stable methods for computing individual MA points and on schemes for deriving the l...
206
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
169
click to vote
AIRS
2009
Springer
16 years 1 months ago
2009
Springer
Relevance-based language models operate by estimating the probabilities of observing words in documents relevant (or pseudo relevant) to a topic. However, these models assume that ...
184
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
Performance of many state-of-the-art face recognition (FR) methods deteriorates rapidly, when large in size databases are considered. In this paper, we propose a novel clustering ...