Sciweavers

558 search results - page 87 / 112
» Trees and Matchings
Sort
View
IIS
2003
15 years 3 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
113
Voted
CIKM
2007
Springer
15 years 8 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
109
Voted
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
15 years 11 months ago
Resource Minimization for Fire Containment
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
Parinya Chalermsook, Julia Chuzhoy
ICDE
2009
IEEE
205views Database» more  ICDE 2009»
16 years 3 months ago
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 1 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite