Sciweavers

1388 search results - page 92 / 278
» Querying Linguistic Trees
Sort
View
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
13 years 3 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
117
Voted
KBSE
2000
IEEE
15 years 5 months ago
Practical Large Scale What-If Queries: Case Studies with Software Risk Assessment
When a lack of data inhibits decision making, large scale what-if queries can be conducted over the uncertain parameter ranges. Such what-if queries can generate an overwhelming a...
Tim Menzies, Erik Sinsel
100
Voted
JGTOOLS
2008
100views more  JGTOOLS 2008»
15 years 18 days ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
98
Voted
DOCENG
2005
ACM
15 years 2 months ago
Managing syntactic variation in text retrieval
Information Retrieval systems are limited by the linguistic variation of language. The use of Natural Language Processing techniques to manage this problem has been studied for a ...
Jesús Vilares, Carlos Gómez-Rodr&iac...
98
Voted
ISCI
2006
136views more  ISCI 2006»
15 years 18 days ago
Computing with words for text processing: An approach to the text categorization
The use of the computing with words paradigm for the automatic text documents categorization problem is discussed. This specific problem of information retrieval (IR) becomes more...
Slawomir Zadrozny, Janusz Kacprzyk