1388 search results - page 127 / 278 » Querying Linguistic Trees |
130
Voted
CACM
1998
15 years 13 days ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
230
click to vote
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
87
Voted
ALGORITHMICA
2002
15 years 18 days ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
112
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
127
Voted
AAAI
2007
15 years 3 months ago
2007
Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on complex logical representation...