Sciweavers

1040 search results - page 191 / 208
» Rounding algorithms for covering problems
Sort
View
JCP
2008
121views more  JCP 2008»
14 years 9 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi
ACL
2009
14 years 7 months ago
Incremental HMM Alignment for MT System Combination
Inspired by the incremental TER alignment, we re-designed the Indirect HMM (IHMM) alignment, which is one of the best hypothesis alignment methods for conventional MT system combi...
Chi-Ho Li, Xiaodong He, Yupeng Liu, Ning Xi
TMM
2011
182views more  TMM 2011»
14 years 4 months ago
Scalable Video Multicast in Hybrid 3G/Ad-Hoc Networks
Mobile video broadcasting service, or mobile TV, is expected to become a popular application for 3G wireless network operators. Most existing solutions for video Broadcast Multica...
Sha Hua, Yang Guo, Yong Liu, Hang Liu, Shivendra S...
PAMI
2010
207views more  PAMI 2010»
14 years 4 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
SPEECH
2010
154views more  SPEECH 2010»
14 years 4 months ago
Long story short - Global unsupervised models for keyphrase based meeting summarization
act 11 We analyze and compare two different methods for unsupervised extractive spontaneous speech summarization in the meeting 12 domain. Based on utterance comparison, we introdu...
Korbinian Riedhammer, Benoît Favre, Dilek Ha...