Sciweavers

5144 search results - page 162 / 1029
» Enhancing Search with Structure
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 4 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
ESWS
2009
Springer
15 years 11 months ago
Folksonomy Enrichment and Search
The Semantic Web community has expressed its interest on how the Semantic Web technology can be applied more efficiently in a manner that supports real world applications. Addition...
Sofia Angeletou, Marta Sabou, Enrico Motta
ISMIS
2003
Springer
15 years 9 months ago
Development of Generic Search Method Based on Transformation Invariance
Abstract. The needs of efficient and flexible information retrieval on multistructural data stored in database and network are significantly growing. Especially, its flexibility pl...
Fuminori Adachi, Takashi Washio, Hiroshi Motoda, A...
WWW
2007
ACM
16 years 5 months ago
Integrating web directories by learning their structures
Documents in the Web are often organized using category trees by information providers (e.g. CNN, BBC) or search engines (e.g. Google, Yahoo!). Such category trees are commonly kn...
Christopher C. Yang, Jianfeng Lin
CLEF
2010
Springer
15 years 5 months ago
Using Web Graph Structure for Person Name Disambiguation
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
Elena Smirnova, Konstantin Avrachenkov, Brigitte T...