Sciweavers

2182 search results - page 416 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
SPEECH
2010
154views more  SPEECH 2010»
13 years 2 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...
ICASSP
2011
IEEE
12 years 11 months ago
Contour-based hidden Markov model to segment 2D ultrasound images
The segmentation of ultrasound images is challenging due to the difficulty of appropriate modeling of their appearance variations including speckle as well as signal dropout. We ...
Xiaoning Qian, Byung-Jun Yoon
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 2 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
DAC
2002
ACM
14 years 8 months ago
ILP-based engineering change
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabl...
Farinaz Koushanfar, Jennifer L. Wong, Jessica Feng...
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
14 years 2 months ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...