Sciweavers

130 search results - page 7 / 26
» Algorithms for Finding a Most Similar Subforest
Sort
View
UAI
1998
14 years 10 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr
SIGIR
2008
ACM
14 years 9 months ago
Algorithmic mediation for collaborative exploratory search
We describe a new approach to information retrieval: algorithmic mediation for intentional, synchronous collaborative exploratory search. Using our system, two or more users with ...
Jeremy Pickens, Gene Golovchinsky, Chirag Shah, Pe...
ICIP
2005
IEEE
15 years 11 months ago
Exploiting discriminant information in elastic graph matching
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...
Stefanos Zafeiriou, Anastasios Tefas, Ioannis Pita...
BMCBI
2005
84views more  BMCBI 2005»
14 years 9 months ago
Information theory-based algorithm for in silico prediction of PCR products with whole genomic sequences as templates
Background: A new algorithm for assessing similarity between primer and template has been developed based on the hypothesis that annealing of primer to template is an information ...
Youfang Cao, Lianjie Wang, Kexue Xu, Chunhai Kou, ...
CCS
2009
ACM
15 years 10 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao