1688 search results - page 217 / 338 » The Complexity of Rationalizing Matchings |
188
click to vote
ICDE
2005
IEEE
16 years 21 days ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
179
click to vote
ICDE
2005
IEEE
16 years 21 days ago
2005
IEEE
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
198
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
ARTCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—This paper presents a Novel Bidirectional motion estimation technique, which is based on the Particle swarm optimization algorithm. Particle swarm optimization (PSO) is a popula...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...