Sciweavers

1282 search results - page 19 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
BIOCOMP
2006
13 years 9 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
EACL
2009
ACL Anthology
13 years 5 months ago
MINT: A Method for Effective and Scalable Mining of Named Entity Transliterations from Large Comparable Corpora
In this paper, we address the problem of mining transliterations of Named Entities (NEs) from large comparable corpora. We leverage the empirical fact that multilingual news artic...
Raghavendra Udupa, K. Saravanan, A. Kumaran, Jagad...
CVPR
2008
IEEE
14 years 9 months ago
Joint data alignment up to (lossy) transformations
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...
Andrea Vedaldi, Gregorio Guidi, Stefano Soatto
AMFG
2003
IEEE
157views Biometrics» more  AMFG 2003»
14 years 29 days ago
Real-time View-based Face Alignment using Active Wavelet Networks
The Active Wavelet Network (AWN) [9] approach was recently proposed for automatic face alignment, showing advantages over Active Appearance Models (AAM), such as more robustness a...
Changbo Hu, Rogerio Feris, Matthew Turk
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 7 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders