31 search results - page 4 / 7 » Free Indexation: Combinatorial Analysis and a Compositional ... |
UIST
2006
ACM
14 years 1 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
BMCBI
2007
13 years 7 months ago
2007
Background: RNA metabolism, through 'combinatorial splicing', can generate enormous structural diversity in the proteome. Alternative domains may interact, however, with...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
3DOR
2010
13 years 2 months ago
2010
While approaches based on local features play a more and more important role for 3D shape retrieval, the problems of feature selection and similarity measurement between sets of l...