Sciweavers

1983 search results - page 131 / 397
» Competitive graph searches
Sort
View
CSL
2008
Springer
13 years 8 months ago
Tone-enhanced generalized character posterior probability (GCPP) for Cantonese LVCSR
Tone-enhanced, generalized character posterior probability (GCPP), a generalized form of posterior probability at subword (Chinese character) level, is proposed as a rescoring met...
Yao Qian, Frank K. Soong, Tan Lee
CVIU
2008
113views more  CVIU 2008»
13 years 8 months ago
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 8 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
SAMT
2009
Springer
135views Multimedia» more  SAMT 2009»
14 years 2 months ago
Exploring Relationships between Annotated Images with the ChainGraph Visualization
Abstract. Understanding relationships and commonalities between digital contents based on metadata is a difficult user task that requires sophisticated presentation forms. In this ...
Steffen Lohmann, Philipp Heim, Lena Tetzlaff, Thom...
AIPS
2008
13 years 10 months ago
Unifying the Causal Graph and Additive Heuristics
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
Malte Helmert, Hector Geffner