778 search results - page 106 / 156 » Modelling a Query Space Using Associations |
106
click to vote
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
Given the complexity of parallel programs, developers often must rely on performance analysis tools to help them improve the performance of their code. While many tools support th...
104
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
116
click to vote
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
Probabilistic latent semantic indexing (PLSI) represents documents of a collection as mixture proportions of latent topics, which are learned from the collection by an expectation...
128
click to vote
FLAIRS
2007
15 years 4 months ago
2007
The basic aim of the model proposed here is to automatically build semantic metatext structure for texts that would allow us to search and extract discourse and semantic informati...
128
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...