Sciweavers

441 search results - page 43 / 89
» Query expansion using random walk models
Sort
View
GLOBECOM
2006
IEEE
14 years 4 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
TKDE
2011
330views more  TKDE 2011»
13 years 4 months ago
Effective Navigation of Query Results Based on Concept Hierarchies
— Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization...
Abhijith Kashyap, Vagelis Hristidis, Michalis Petr...
ICST
2010
IEEE
13 years 8 months ago
Generating Transition Probabilities for Automatic Model-Based Test Generation
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
Abderrahmane Feliachi, Hélène Le Gue...
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
14 years 3 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
KDD
2000
ACM
140views Data Mining» more  KDD 2000»
14 years 1 months ago
Effective Retrieval of Audio Information from Annotated Text Using Ontologies
To improve the accuracy in terms of precision and recall of an audio information retrieval system we have created a domainspecific ontology (a collection of key concepts and their...
Latifur Khan, Dennis McLeod