Sciweavers

1127 search results - page 12 / 226
» Testing the Expansion of a Graph
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 11 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
DM
2002
97views more  DM 2002»
13 years 10 months ago
Resonance graphs of catacondensed even ring systems are median
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...
Sandi Klavzar, Petra Zigert, Gunnar Brinkmann
ICAIL
2007
ACM
14 years 21 days ago
Legal Query Expansion using Ontologies and Relevance Feedback
The aim of our research is the improvement of Boolean search with query expansion using lexical ontologies and user feedback. User studies strongly suggest that standard search tec...
Erich Schweighofer, Anton Geist
ICIP
1997
IEEE
14 years 3 months ago
Joint adaptive space and frequency basis selection
We develop a new method for building a representation of an image from a library of basis elements that is facilitated by a joint adaptive space and frequency JASF graph. The JA...
John R. Smith, Shih-Fu Chang
ICTAI
2003
IEEE
14 years 4 months ago
Query Expansion and Query Reduction in Document Retrieval
We investigate two seemingly incompatible approaches for improving document retrieval performance in the context of question answering: query expansion and query reduction. Querie...
Ingrid Zukerman, Bhavani Raskutti, Yingying Wen