Sciweavers

1388 search results - page 143 / 278
» Querying Linguistic Trees
Sort
View
84
Voted
SPIRE
2005
Springer
15 years 6 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
124
Voted
COMAD
2008
15 years 2 months ago
Concurrency Control in Distributed MRA Index Structure
Answering aggregate queries like sum, count, min, max over regions containing moving objects is often needed for virtual world applications, real-time monitoring systems, etc. Sin...
Neha Singh, S. Sudarshan
93
Voted
TALG
2008
127views more  TALG 2008»
15 years 19 days ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
93
Voted
CIKM
2007
Springer
15 years 7 months ago
Recognition and classification of noun phrases in queries for effective retrieval
It has been shown that using phrases properly in the document retrieval leads to higher retrieval effectiveness. In this paper, we define four types of noun phrases and present an...
Wei Zhang, Shuang Liu, Clement T. Yu, Chaojing Sun...
113
Voted
CIKM
2005
Springer
15 years 6 months ago
Word sense disambiguation in queries
This paper presents a new approach to determine the senses of words in queries by using WordNet. In our approach, noun phrases in a query are determined first. For each word in th...
Shuang Liu, Clement T. Yu, Weiyi Meng