Sciweavers

1023 search results - page 120 / 205
» Graph model selection using maximum likelihood
Sort
View
GAMESEC
2010
139views Game Theory» more  GAMESEC 2010»
13 years 8 months ago
Design of Network Topology in an Adversarial Environment
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
Assane Gueye, Jean C. Walrand, Venkat Anantharam
CLEF
2009
Springer
13 years 11 months ago
Unsupervised Word Decomposition with the Promodes Algorithm
We present Promodes, an algorithm for unsupervised word decomposition, which is based on a probabilistic generative model. The model considers segment boundaries as hidden variable...
Sebastian Spiegler, Bruno Golénia, Peter A....
CIKM
2006
Springer
14 years 1 months ago
Coupling feature selection and machine learning methods for navigational query identification
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed
JMM2
2007
127views more  JMM2 2007»
13 years 10 months ago
Robust Face Recognition through Local Graph Matching
— A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometr...
Ehsan Fazl Ersi, John S. Zelek, John K. Tsotsos
DATE
2008
IEEE
131views Hardware» more  DATE 2008»
14 years 4 months ago
Parametric Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...
Amir Hossein Ghamarian, Marc Geilen, Twan Basten, ...