Sciweavers

182 search results - page 7 / 37
» Structured semidefinite representation of some convex sets
Sort
View
88
Voted
WWW
2001
ACM
16 years 9 days ago
Algorithms and programming models for efficient representation of XML for Internet applications
XML is poised to take the World-Wide-Web to the next level of innovation. XML data, large or small, with or without associated schema, will be exchanged between increasing number ...
Neel Sundaresan, Reshad Moussa
ICASSP
2011
IEEE
14 years 3 months ago
A novel approach using modulation features for multiphone-based speech recognition
Recent advances in coherent and convex demodulation have proven useful for analyzing and modifying the low-frequency envelope structure of speech. This paper reports the applicati...
Pascal Clark, Gregory Sell, Les E. Atlas
CORR
2010
Springer
275views Education» more  CORR 2010»
14 years 11 months ago
Dictionary Optimization for Block-Sparse Representations
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...
LATIN
2010
Springer
15 years 6 months ago
Compact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
Jérémy Barbay, Francisco Claude, Gon...
94
Voted
ACL
2011
14 years 3 months ago
Domain Adaptation by Constraining Inter-Domain Variability of Latent Feature Representation
We consider a semi-supervised setting for domain adaptation where only unlabeled data is available for the target domain. One way to tackle this problem is to train a generative m...
Ivan Titov