Sciweavers

1671 search results - page 290 / 335
» On the Covering Steiner Problem
Sort
View
CVPR
2011
IEEE
13 years 7 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
TMM
2011
182views more  TMM 2011»
13 years 6 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...
IFIP
2010
Springer
13 years 5 months ago
Scenario-Based Modeling in Industrial Information Systems
This manuscript addresses the creation of scenario-based models to reason about the behavior of existing industrial information systems. In our approach the system behavior is mode...
Ricardo Jorge Machado, João M. Fernandes, J...
PAMI
2010
207views more  PAMI 2010»
13 years 5 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»
13 years 5 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...