Sciweavers

2553 search results - page 208 / 511
» Modeling Trees with Hypertextures
Sort
View
ACL
2009
15 years 1 months ago
Semantic Tagging of Web Search Queries
We present a novel approach to parse web search queries for the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which genera...
Mehdi Manshadi, Xiao Li
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
15 years 1 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 6 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
KDD
2001
ACM
164views Data Mining» more  KDD 2001»
16 years 4 months ago
Data mining criteria for tree-based regression and classification
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
Andreas Buja, Yung-Seop Lee
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
16 years 4 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou