906 search results - page 145 / 182 » Matching Subsequences in Trees |
IIS
2003
13 years 9 months ago
2003
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...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
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...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...