THESE DE DOCTORAT DE L'ECOLE NORMALE SUPERIEURE DE CACHAN
暂无分享,去创建一个
[1] Trevor Darrell,et al. An efficient projection for l 1 , infinity regularization. , 2009, ICML 2009.
[2] Pierre Morizet-Mahoudeaux,et al. Hierarchical Penalization , 2007, NIPS.
[3] N. Meinshausen,et al. Stability selection , 2008, 0809.2932.
[4] Volker Roth,et al. The Group-Lasso for generalized linear models: uniqueness of solutions and efficient algorithms , 2008, ICML '08.
[5] Lester W. Mackey,et al. Deflation Methods for Sparse PCA , 2008, NIPS.
[6] Jean Ponce,et al. Convex Sparse Matrix Factorizations , 2008, ArXiv.
[7] Eric P. Xing,et al. MedLDA: maximum margin supervised topic models for regression and classification , 2009, ICML '09.
[8] Antonio Torralba,et al. Nonparametric scene parsing: Label transfer via dense scene alignment , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[9] Alexei A. Efros,et al. Blocks World Revisited: Image Understanding Using Qualitative Geometry and Mechanics , 2010, ECCV.
[10] Stavros Tripakis,et al. Model Checking of Real-Time Reachability Properties Using Abstractions , 1998, TACAS.
[11] Zhi-Quan Luo,et al. Semidefinite Relaxation of Quadratic Optimization Problems , 2010, IEEE Signal Processing Magazine.
[12] Wray L. Buntine. Variational Extensions to EM and Multinomial PCA , 2002, ECML.
[13] Julien Mairal,et al. Network Flow Algorithms for Structured Sparsity , 2010, NIPS.
[14] Kim G. Larsen,et al. Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.
[15] H. Zou,et al. Regularization and variable selection via the elastic net , 2005 .
[16] Ian T. Jolliffe,et al. Principal Component Analysis , 1986, Springer Series in Statistics.
[17] Michael I. Jordan,et al. Discriminative machine learning with structure , 2009 .
[18] Qi Zhang,et al. EM-DD: An Improved Multiple-Instance Learning Technique , 2001, NIPS.
[19] S. C. Johnson. Hierarchical clustering schemes , 1967, Psychometrika.
[20] R. Fergus,et al. Learning invariant features through topographic filter maps , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[21] Rajeev Alur,et al. Model-Checking in Dense Real-time , 1993, Inf. Comput..
[22] D. Chklovskii,et al. Maps in the brain: what can we learn from them? , 2004, Annual review of neuroscience.
[23] Joseph Sifakis,et al. On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.
[24] Geoffrey E. Hinton,et al. Adaptive Mixtures of Local Experts , 1991, Neural Computation.
[25] Stephen C. Strother,et al. Support vector machines for temporal classification of block design fMRI data , 2005, NeuroImage.
[26] Jean-Francois Mangin,et al. Probabilistic Anatomo-Functional Parcellation of the Cortex: How Many Regions? , 2008, MICCAI.
[27] Thomas A. Henzinger,et al. The Control of Synchronous Systems , 2000, CONCUR.
[28] Thomas Gärtner,et al. Multi-Instance Kernels , 2002, ICML.
[29] Eyke Hüllermeier,et al. Learning from ambiguously labeled examples , 2005, Intell. Data Anal..
[30] Jason Weston,et al. Gene Selection for Cancer Classification using Support Vector Machines , 2002, Machine Learning.
[31] David A. Forsyth,et al. Thinking Inside the Box: Using Appearance Models and Context Based on Room Geometry , 2010, ECCV.
[32] Mark Craven,et al. Supervised versus multiple instance learning: an empirical comparison , 2005, ICML.
[33] Svetlana Lazebnik,et al. Superparsing , 2010, International Journal of Computer Vision.
[34] Cordelia Schmid,et al. Actions in context , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[35] Peter J. Ramadge,et al. Boosting with Spatial Regularization , 2009, NIPS.
[36] David J. Field,et al. Sparse coding with an overcomplete basis set: A strategy employed by V1? , 1997, Vision Research.
[37] Jean Ponce,et al. Efficient Optimization for Discriminative Latent Class Models , 2010, NIPS.
[38] Robert D. Nowak,et al. Signal Reconstruction From Noisy Random Projections , 2006, IEEE Transactions on Information Theory.
[39] Thomas A. Henzinger,et al. The Element of Surprise in Timed Games , 2003, CONCUR.
[40] Pierre-Yves Schobbens,et al. A New Algorithm for Strategy Synthesis in LTL Games , 2005, TACAS.
[41] Jianbo Shi,et al. Spectral segmentation with multiscale graph decomposition , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[42] Luca de Alfaro,et al. Linear and Branching Metrics for Quantitative Transition Systems , 2004, ICALP.
[43] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[44] Alexander I. Barvinok,et al. Problems of distance geometry and convex properties of quadratic maps , 1995, Discret. Comput. Geom..
[45] D. Hunter,et al. A Tutorial on MM Algorithms , 2004 .
[46] E. Clarke,et al. Real-time symbolic model checking for discrete time models , 1994 .
[47] Kim G. Larsen,et al. Model Checking One-clock Priced Timed Automata , 2007, Log. Methods Comput. Sci..
[48] Kaustubh Supekar,et al. Sparse logistic regression for whole-brain classification of fMRI data , 2010, NeuroImage.
[49] Nicolas Markey,et al. Timed Concurrent Game Structures , 2007, CONCUR.
[50] Joseph Sifakis,et al. Controller Synthesis for Timed Automata 1 , 1998 .
[51] P. Tseng. Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization , 2001 .
[52] I Daubechies,et al. Independent component analysis for brain fMRI does not select for independence , 2009 .
[53] Gaël Varoquaux,et al. Detection of Brain Functional-Connectivity Difference in Post-stroke Patients Using Group-Level Covariance Modeling , 2010, MICCAI.
[54] S. Fienberg. An Iterative Procedure for Estimation in Contingency Tables , 1970 .
[55] John Langford,et al. Sparse Online Learning via Truncated Gradient , 2008, NIPS.
[56] Cordelia Schmid,et al. Local Features and Kernels for Classification of Texture and Object Categories: A Comprehensive Study , 2006, 2006 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'06).
[57] Pierre-Yves Schobbens,et al. Alternating-time logic with imperfect recall , 2004, LCMAS.
[58] Cordelia Schmid,et al. Combining efficient object localization and image classification , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[59] Massimiliano Pontil,et al. Taking Advantage of Sparsity in Multi-Task Learning , 2009, COLT.
[60] Alan M. Frieze,et al. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.
[61] Gábor Lugosi,et al. Concentration Inequalities , 2008, COLT.
[62] Francis R. Bach,et al. Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning , 2008, NIPS.
[63] J. Tropp. Norms of Random Submatrices and Sparse Approximation , 2008 .
[64] Ming-Hsuan Yang,et al. Visual tracking with online Multiple Instance Learning , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[65] Francis R. Bach,et al. Structured Sparse Principal Component Analysis , 2009, AISTATS.
[66] Stephen Gould,et al. Decomposing a scene into geometric and semantically consistent regions , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[67] Vladimir Kolmogorov,et al. What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[68] Joel A. Tropp,et al. Just relax: convex programming methods for identifying sparse signals in noise , 2006, IEEE Transactions on Information Theory.
[69] Mikhail Belkin,et al. Regularization and Semi-supervised Learning on Large Graphs , 2004, COLT.
[70] Dale Schuurmans,et al. Convex Relaxation of Mixture Regression with Efficient Algorithms , 2009, NIPS.
[71] David M. Bradley,et al. Convex Coding , 2009, UAI.
[72] P. Cameron. Combinatorics: Topics, Techniques, Algorithms , 1995 .
[73] J. H. Ward. Hierarchical Grouping to Optimize an Objective Function , 1963 .
[74] Yair Weiss,et al. The 'tree-dependent components' of natural scenes are edge filters , 2009, NIPS.
[75] G. W. Stewart,et al. Computer Science and Scientific Computing , 1990 .
[76] Kim-Chuan Toh,et al. SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .
[77] Heribert Vollmer,et al. Introduction to Circuit Complexity: A Uniform Approach , 2010 .
[78] Lawrence Carin,et al. Exploiting Structure in Wavelet-Based Bayesian Compressive Sensing , 2009, IEEE Transactions on Signal Processing.
[79] Peter Auer,et al. A Boosting Approach to Multiple Instance Learning , 2004, ECML.
[80] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.
[81] H. Groenevelt. Two algorithms for maximizing a separable concave function over a polymatroid feasible region , 1991 .
[82] Sven J. Dickinson,et al. TurboPixels: Fast Superpixels Using Geometric Flows , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[83] Zaïd Harchaoui,et al. DIFFRAC: a discriminative and flexible framework for clustering , 2007, NIPS.
[84] Dale Schuurmans,et al. Maximum Margin Clustering , 2004, NIPS.
[85] Takeo Kanade,et al. Discriminative cluster analysis , 2006, ICML.
[86] Volkan Cevher,et al. Learning with Compressible Priors , 2009, NIPS.
[87] Mark W. Schmidt,et al. Convex Structure Learning in Log-Linear Models: Beyond Pairwise Potentials , 2010, AISTATS.
[88] Nancy A. Lynch,et al. Liveness in Timed and Untimed Systems , 1994, Inf. Comput..
[89] Philippe Schnoebelen,et al. Model Checking CTL+ and FCTL is Hard , 2001, FoSSaCS.
[90] Yoram Singer,et al. Efficient projections onto the l1-ball for learning in high dimensions , 2008, ICML '08.
[91] Nello Cristianini,et al. Learning the Kernel Matrix with Semidefinite Programming , 2002, J. Mach. Learn. Res..
[92] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[93] Andrew V. Goldberg,et al. Experimental Evaluation of a Parametric Flow Algorithm , 2006 .
[94] Han Liu,et al. Nonparametric learning in high dimensions , 2010 .
[95] Larry J. Stockmeyer,et al. Improved upper and lower bounds for modal logics of programs , 1985, STOC '85.
[96] R. Tibshirani,et al. A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. , 2009, Biostatistics.
[97] Yixin Chen,et al. Image Categorization by Learning and Reasoning with Regions , 2004, J. Mach. Learn. Res..
[98] Li Fei-Fei,et al. Spatially coherent latent topic model for concurrent object segmentation and classification , 2007 .
[99] Gabriel Peyré,et al. Sparse Modeling of Textures , 2009, Journal of Mathematical Imaging and Vision.
[100] Robert D. Nowak,et al. Wavelet-based statistical signal processing using hidden Markov models , 1998, IEEE Trans. Signal Process..
[101] Geraldo Galdino de Paula,et al. A linear-time median-finding algorithm for projecting a vector on the simplex of Rn , 1989 .
[102] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[103] H. Barlow. Vision: A computational investigation into the human representation and processing of visual information: David Marr. San Francisco: W. H. Freeman, 1982. pp. xvi + 397 , 1983 .
[104] Thomas A. Henzinger,et al. Real-time logics: complexity and expressiveness , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.
[105] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[106] Kim Guldstrand Larsen,et al. Almost Optimal Strategies in One Clock Priced Timed Automata , 2007 .
[107] Charles A. Micchelli,et al. A Family of Penalty Functions for Structured Sparsity , 2010, NIPS.
[108] M. R. Osborne,et al. A new approach to variable selection in least squares problems , 2000 .
[109] Guillermo Sapiro,et al. Non-local sparse models for image restoration , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[110] Lukasz Kaiser,et al. Model Checking Games for the Quantitative mu-Calculus , 2008, STACS.
[111] Yonina C. Eldar,et al. Collaborative hierarchical sparse modeling , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).
[112] Nicholas Ayache,et al. Improved Detection Sensitivity in Functional MRI Data Using a Brain Parcelling Technique , 2002, MICCAI.
[113] 安藤 毅. Completely positive matrices , 1991 .
[114] Martin J. Wainwright,et al. Restricted Eigenvalue Properties for Correlated Gaussian Designs , 2010, J. Mach. Learn. Res..
[115] Guillermo Sapiro,et al. Supervised Dictionary Learning , 2008, NIPS.
[116] Pierre-Yves Schobbens,et al. Approximating ATL* in ATL , 2002, VMCAI.
[117] Nicolas Markey,et al. Robustness and Implementability of Timed Automata , 2004, FORMATS/FTRTFT.
[118] B. Taskar,et al. Learning from ambiguously labeled images , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[119] M M Waldrop,et al. Phobos at Mars: A Dramatic View--and Then Failure. , 1989, Science.
[120] K. Lange,et al. Coordinate descent algorithms for lasso penalized regression , 2008, 0803.3876.
[121] Fernand Meyer,et al. Hierarchies of Partitions and Morphological Segmentation , 2001, Scale-Space.
[122] R. Tibshirani,et al. Least angle regression , 2004, math/0406456.
[123] Junzhou Huang,et al. The Benefit of Group Sparsity , 2009 .
[124] Shuheng Zhou. Restricted Eigenvalue Conditions on Subgaussian Random Matrices , 2009, 0912.4045.
[125] Michael Elad,et al. Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries , 2006, IEEE Transactions on Image Processing.
[126] Amir Pnueli,et al. The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[127] F. T. Wright,et al. A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables , 1971 .
[128] Marie-Pierre Jolly,et al. Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.
[129] Xi Chen,et al. An Efficient Proximal-Gradient Method for Single and Multi-task Regression with Structured Sparsity , 2010, ArXiv.
[130] Michael I. Jordan,et al. A Direct Formulation for Sparse Pca Using Semidefinite Programming , 2004, SIAM Rev..
[131] P. Massart,et al. Concentration inequalities and model selection , 2007 .
[132] N. Meinshausen,et al. High-dimensional graphs and variable selection with the Lasso , 2006, math/0608017.
[133] Dale Schuurmans,et al. Convex Relaxations of Latent Variable Training , 2007, NIPS.
[134] Alexei A. Efros,et al. Using Multiple Segmentations to Discover Objects and their Extent in Image Collections , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[135] Marc Teboulle,et al. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..
[136] M. Wertheimer. Laws of organization in perceptual forms. , 1938 .
[137] Babak Hassibi,et al. On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements , 2008, IEEE Transactions on Signal Processing.
[138] Alexandre d'Aspremont,et al. Optimal Solutions for Sparse Principal Component Analysis , 2007, J. Mach. Learn. Res..
[139] E. Lehmann. Testing Statistical Hypotheses , 1960 .
[140] Thomas A. Henzinger,et al. Alternating-time temporal logic , 2002, JACM.
[141] David M. Bradley,et al. Differentiable Sparse Coding , 2008, NIPS.
[142] I. Jolliffe,et al. A Modified Principal Component Technique Based on the LASSO , 2003 .
[143] Han Liu,et al. Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery , 2009, ICML '09.
[144] Richard G. Baraniuk,et al. Near Best Tree Approximation , 2002, Adv. Comput. Math..
[145] H. Sebastian Seung,et al. Learning the parts of objects by non-negative matrix factorization , 1999, Nature.
[146] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[147] I. Johnstone,et al. Adapting to Unknown Smoothness via Wavelet Shrinkage , 1995 .
[148] Martin J. Wainwright,et al. A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers , 2009, NIPS.
[149] Volkan Cevher,et al. Sparse Signal Recovery Using Markov Random Fields , 2008, NIPS.
[150] Geoffrey J. Gordon,et al. A Unified View of Matrix Factorization Models , 2008, ECML/PKDD.
[151] Yihong Gong,et al. Nonlinear Learning using Local Coordinate Coding , 2009, NIPS.
[152] Oded Maron,et al. Multiple-Instance Learning for Natural Scene Classification , 1998, ICML.
[153] Christian Windischberger,et al. Toward discovery science of human brain function , 2010, Proceedings of the National Academy of Sciences.
[154] David L. Dill,et al. Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.
[155] Sophie Pinchinat. A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies , 2007, ATVA.
[156] Volkan Cevher,et al. Model-Based Compressive Sensing , 2008, IEEE Transactions on Information Theory.
[157] Rajat Raina,et al. Efficient sparse coding algorithms , 2006, NIPS.
[158] R. DeVore,et al. A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .
[159] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[160] Rainer Goebel,et al. Combining multivariate voxel selection and support vector machines for mapping and classification of fMRI spatial patterns , 2008, NeuroImage.
[161] Guillermo Sapiro,et al. Non-Parametric Bayesian Dictionary Learning for Sparse Image Representations , 2009, NIPS.
[162] Jean-Baptiste Poline,et al. A group model for stable multi-subject ICA on fMRI datasets , 2010, NeuroImage.
[163] Dorit S. Hochbaum,et al. About strongly polynomial time algorithms for quadratic optimization over submodular constraints , 1995, Math. Program..
[164] Jean-Baptiste Poline,et al. Inferring behavior from functional brain images , 1998, Nature Neuroscience.
[165] S. Geer,et al. On the conditions used to prove oracle results for the Lasso , 2009, 0910.0722.
[166] Deanna Needell,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.
[167] P. Brucker. Review of recent development: An O( n) algorithm for quadratic knapsack problems , 1984 .
[168] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[169] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[170] Vikas Singh,et al. An efficient algorithm for Co-segmentation , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[171] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[172] D. Donoho,et al. Translation-Invariant De-Noising , 1995 .
[173] Pushmeet Kohli,et al. Robust Higher Order Potentials for Enforcing Label Consistency , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[174] Stephen M. Smith,et al. Investigations into resting-state connectivity using independent component analysis , 2005, Philosophical Transactions of the Royal Society B: Biological Sciences.
[175] Samuel Burer,et al. D.C. Versus Copositive Bounds for Standard QP , 2005, J. Glob. Optim..
[176] George J. Pappas,et al. Optimal Paths in Weighted Timed Automata , 2001, HSCC.
[177] Anuj Puri,et al. Dynamical Properties of Timed Automata , 1998, Discret. Event Dyn. Syst..
[178] Allen Y. Yang,et al. Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[179] E. Candès,et al. Near-ideal model selection by ℓ1 minimization , 2008, 0801.0345.
[180] Francis R. Bach,et al. Low-Rank Optimization on the Cone of Positive Semidefinite Matrices , 2008, SIAM J. Optim..
[181] Wenjiang J. Fu. Penalized Regressions: The Bridge versus the Lasso , 1998 .
[182] David A. Forsyth,et al. Matching Words and Pictures , 2003, J. Mach. Learn. Res..
[183] Thorsten Joachims,et al. Transductive Inference for Text Classification using Support Vector Machines , 1999, ICML.
[184] Jean-Philippe Vert,et al. Group lasso with overlap and graph lasso , 2009, ICML '09.
[185] Yoshua. Bengio,et al. Learning Deep Architectures for AI , 2007, Found. Trends Mach. Learn..
[186] Cordelia Schmid,et al. Human Detection Using Oriented Histograms of Flow and Appearance , 2006, ECCV.
[187] Tommi S. Jaakkola,et al. Maximum-Margin Matrix Factorization , 2004, NIPS.
[188] Wojciech Jamroga,et al. What agents can achieve under incomplete information , 2006, AAMAS '06.
[189] Michael I. Jordan,et al. Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..
[190] Jean Ponce,et al. Segmentation by transduction , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[191] Yoram Singer,et al. Efficient Online and Batch Learning Using Forward Backward Splitting , 2009, J. Mach. Learn. Res..
[192] M. Yuan,et al. Model selection and estimation in regression with grouped variables , 2006 .
[193] Tong Zhang. Some sharp performance bounds for least squares regression with L1 regularization , 2009, 0908.2869.
[194] Neil Immerman,et al. "An n! lower bound on formula size" , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.
[195] Thomas G. Dietterich,et al. Solving the Multiple Instance Problem with Axis-Parallel Rectangles , 1997, Artif. Intell..
[196] Yurii Nesterov,et al. Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.
[197] Xiaoming Huo,et al. Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.
[198] Derek Hoiem,et al. Category Independent Object Proposals , 2010, ECCV.
[199] Nicolas Markey,et al. Good Friends are Hard to Find! , 2008, 2008 15th International Symposium on Temporal Representation and Reasoning.
[200] L. Toth,et al. How accurate is magnetic resonance imaging of brain function? , 2003, Trends in Neurosciences.
[201] Avinash C. Kak,et al. PCA versus LDA , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[202] Jean-Baptiste Poline,et al. ICA-based sparse features recovery from fMRI datasets , 2010, 2010 IEEE International Symposium on Biomedical Imaging: From Nano to Macro.
[203] Patrik O. Hoyer,et al. Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..
[204] Fan Chung,et al. Spectral Graph Theory , 1996 .
[205] Wenjiang J. Fu,et al. Asymptotics for lasso-type estimators , 2000 .
[206] Jean-Baptiste Poline,et al. A supervised clustering approach for extracting predictive information from brain activation images , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops.
[207] Jiebo Luo,et al. iCoseg: Interactive co-segmentation with intelligent scribble guidance , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[208] Avrim Blum,et al. The Bottleneck , 2021, Monopsony Capitalism.
[209] Thomas A. Henzinger,et al. From verification to control: dynamic programs for omega-regular objectives , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.
[210] D. Donoho. CART AND BEST-ORTHO-BASIS: A CONNECTION' , 1997 .
[211] A. Bruckstein,et al. K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .
[212] S. Mendelson,et al. Uniform Uncertainty Principle for Bernoulli and Subgaussian Ensembles , 2006, math/0608665.
[213] A. Prasad Sistla,et al. Quantitative temporal reasoning , 1990, Real-Time Systems.
[214] Pierre Soille,et al. Morphological Image Analysis: Principles and Applications , 2003 .
[215] Thomas L. Griffiths,et al. The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies , 2007, JACM.
[216] J. Moreau. Fonctions convexes duales et points proximaux dans un espace hilbertien , 1962 .
[217] Robert E. Tarjan,et al. A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..
[218] Jitendra Malik,et al. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.
[219] Nicolas Markey,et al. On the Expressiveness and Complexity of ATL , 2007, FoSSaCS.
[220] H. Zou. The Adaptive Lasso and Its Oracle Properties , 2006 .
[221] R. Tibshirani,et al. Sparse Principal Component Analysis , 2006 .
[222] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.
[223] Thomas A. Henzinger,et al. A really temporal logic , 1994, JACM.
[224] Krishnendu Chatterjee,et al. Strategy logic , 2007, Inf. Comput..
[225] Ji Zhu,et al. Boosting as a Regularized Path to a Maximum Margin Classifier , 2004, J. Mach. Learn. Res..
[226] Edoardo M. Airoldi,et al. Mixed Membership Stochastic Blockmodels , 2007, NIPS.
[227] Matthieu Kowalski,et al. Improving M/EEG source localizationwith an inter-condition sparse prior , 2009, 2009 IEEE International Symposium on Biomedical Imaging: From Nano to Macro.
[228] Eric P. Xing,et al. Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity , 2009, ICML.
[229] J. S. Rao,et al. Spike and slab variable selection: Frequentist and Bayesian strategies , 2005, math/0505633.
[230] Scott T. Acton,et al. Watershed pyramids for edge detection , 1997, Proceedings of International Conference on Image Processing.
[231] Zhi-Hua Zhou,et al. On the relation between multi-instance learning and semi-supervised learning , 2007, ICML '07.
[232] Chih-Jen Lin,et al. A Comparison of Optimization Methods and Software for Large-scale L1-regularized Linear Classification , 2010, J. Mach. Learn. Res..
[233] E. Feron,et al. Resolution of Conflicts Involving Many Aircraft via Semidefinite Programming , 2001 .
[234] Andrew Blake,et al. "GrabCut" , 2004, ACM Trans. Graph..
[235] Theodosios Pavlidis,et al. Segmentation of pictures and maps through functional approximation , 1972, Comput. Graph. Image Process..
[236] Jean-Jacques Fuchs,et al. Recovery of exact sparse representations in the presence of bounded noise , 2005, IEEE Transactions on Information Theory.
[237] Michael W. Mahoney,et al. CUR from a Sparse Optimization Viewpoint , 2010, NIPS.
[238] Nebojsa Jojic,et al. LOCUS: learning object classes with unsupervised segmentation , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[239] Robert E. Mahony,et al. Optimization Algorithms on Matrix Manifolds , 2007 .
[240] P. Zhao,et al. The composite absolute penalties family for grouped and hierarchical variable selection , 2009, 0909.0411.
[241] Balas K. Natarajan,et al. Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..
[242] Massimiliano Pontil,et al. Multi-Task Feature Learning , 2006, NIPS.
[243] J. Mairal. Sparse coding for machine learning, image processing and computer vision , 2010 .
[244] Martin J. Wainwright,et al. Model Selection in Gaussian Graphical Models: High-Dimensional Consistency of l1-regularized MLE , 2008, NIPS.
[245] Philippe Schnoebelen,et al. Efficient timed model checking for discrete-time systems , 2006, Theor. Comput. Sci..
[246] Emmanuel Barillot,et al. Classification of arrayCGH data using fused SVM , 2008, ISMB.
[247] Massimiliano Pontil,et al. $K$ -Dimensional Coding Schemes in Hilbert Spaces , 2010, IEEE Transactions on Information Theory.
[248] Mei Han,et al. Efficient hierarchical graph-based video segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[249] Paul Tseng,et al. A coordinate gradient descent method for nonsmooth separable minimization , 2008, Math. Program..
[250] Stavros Tripakis,et al. KRONOS: A Model-Checking Tool for Real-Time Systems (Tool-Presentation for FTRTFT '98) , 1998, FTRTFT.
[251] Alexei A. Efros,et al. Putting Objects in Perspective , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[252] Ben Taskar,et al. Joint covariate selection and joint subspace selection for multiple classification problems , 2010, Stat. Comput..
[253] Samuel Burer,et al. Optimizing a polyhedral-semidefinite relaxation of completely positive programs , 2010, Math. Program. Comput..
[254] Adam J. Rothman,et al. Sparse estimation of large covariance matrices via a nested Lasso penalty , 2008, 0803.3872.
[255] Thomas A. Henzinger,et al. Timed Alternating-Time Temporal Logic , 2006, FORMATS.
[256] Francis R. Bach,et al. Consistency of the group Lasso and multiple kernel learning , 2007, J. Mach. Learn. Res..
[257] William T. Freeman,et al. Understanding belief propagation and its generalizations , 2003 .
[258] Richard G. Baraniuk,et al. Optimal tree approximation with wavelets , 1999, Optics & Photonics.
[259] Andrew Blake,et al. Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[260] B. Schölkopf,et al. High-Dimensional Graphical Model Selection Using ℓ1-Regularized Logistic Regression , 2007 .
[261] Jianbo Shi,et al. Recognizing objects by piecing together the Segmentation Puzzle , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[262] L. Rudin,et al. Nonlinear total variation based noise removal algorithms , 1992 .
[263] Jorge Nocedal,et al. On the limited memory BFGS method for large scale optimization , 1989, Math. Program..
[264] M. Boly,et al. Default network connectivity reflects the level of consciousness in non-communicative brain-damaged patients. , 2010, Brain : a journal of neurology.
[265] Yinyu Ye,et al. Semidefinite programming for ad hoc wireless sensor network localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.
[266] Hongbin Zha,et al. Adaptive p-posterior mixture-model kernels for multiple instance learning , 2008, ICML '08.
[267] S. Rosset,et al. Piecewise linear regularized solution paths , 2007, 0708.2197.
[268] Klaus Nordhausen,et al. The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Second Edition by Trevor Hastie, Robert Tibshirani, Jerome Friedman , 2009 .
[269] Nello Cristianini,et al. Kernel Methods for Pattern Analysis , 2004 .
[270] Valentin Goranko,et al. Complete axiomatization and decidability of Alternating-time temporal logic , 2006, Theor. Comput. Sci..
[271] Olga Veksler,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[272] Junzhou Huang,et al. Learning with structured sparsity , 2009, ICML '09.
[273] Michael I. Jordan,et al. Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..
[274] Cristian Sminchisescu,et al. Constrained parametric min-cuts for automatic object segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[275] Jean-Baptiste Poline,et al. Dealing with the shortcomings of spatial normalization: Multi‐subject parcellation of fMRI datasets , 2006, Human brain mapping.
[276] R. Tibshirani,et al. PATHWISE COORDINATE OPTIMIZATION , 2007, 0708.1485.
[277] James T. Kwok,et al. Accelerated Gradient Methods for Stochastic Optimization and Online Learning , 2009, NIPS.
[278] R. Adler. An introduction to continuity, extrema, and related topics for general Gaussian processes , 1990 .
[279] Michael I. Jordan,et al. DiscLDA: Discriminative Learning for Dimensionality Reduction and Classification , 2008, NIPS.
[280] Nancy Bertin,et al. Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis , 2009, Neural Computation.
[281] Ivor W. Tsang,et al. Maximum Margin Clustering Made Practical , 2007, IEEE Transactions on Neural Networks.
[282] David D. Cox,et al. Functional magnetic resonance imaging (fMRI) “brain reading”: detecting and classifying distributed patterns of fMRI activity in human visual cortex , 2003, NeuroImage.
[283] Larry A. Wasserman,et al. Stability Approach to Regularization Selection (StARS) for High Dimensional Graphical Models , 2010, NIPS.
[284] Guillermo Sapiro,et al. Online Learning for Matrix Factorization and Sparse Coding , 2009, J. Mach. Learn. Res..
[285] I. Daubechies,et al. Iteratively reweighted least squares minimization for sparse recovery , 2008, 0807.0575.
[286] Jean Ponce,et al. Automatic annotation of human actions in video , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[287] Alan L. Yuille,et al. The Concave-Convex Procedure , 2003, Neural Computation.
[288] A. Atiya,et al. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond , 2005, IEEE Transactions on Neural Networks.
[289] Jean-Yves Audibert. PAC-Bayesian aggregation and multi-armed bandits , 2010 .
[290] Jean Ponce,et al. Discriminative clustering for image co-segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[291] James T. Kwok,et al. Marginalized Multi-Instance Kernels , 2007, IJCAI.
[292] Jelani Nelson. Johnson-Lindenstrauss notes , 2010 .
[293] Hayit Greenspan,et al. Finding Pictures of Objects in Large Collections of Images , 1996, Object Representation in Computer Vision.
[294] Xin Xu,et al. Logistic Regression and Boosting for Labeled Bags of Instances , 2004, PAKDD.
[295] Patrick L. Combettes,et al. Signal Recovery by Proximal Forward-Backward Splitting , 2005, Multiscale Model. Simul..
[296] Wang Yi,et al. UPPAAL: Status & Developments , 1997, CAV.
[297] Yong Yu,et al. Robust Subspace Segmentation by Low-Rank Representation , 2010, ICML.
[298] Ashwin Srinivasan,et al. Multi-instance tree learning , 2005, ICML.
[299] R. Tibshirani,et al. A note on the group lasso and a sparse group lasso , 2010, 1001.0736.
[300] Marcin Jurdziński,et al. Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..
[301] P. Bickel,et al. SIMULTANEOUS ANALYSIS OF LASSO AND DANTZIG SELECTOR , 2008, 0801.1095.
[302] Stephen M. Smith,et al. Probabilistic independent component analysis for functional magnetic resonance imaging , 2004, IEEE Transactions on Medical Imaging.
[303] Jean-Baptiste Poline,et al. Brain covariance selection: better individual functional connectivity models using population prior , 2010, NIPS.
[304] Rong Jin,et al. Learning with Multiple Labels , 2002, NIPS.
[305] Dorin Comaniciu,et al. Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[306] David M. Blei,et al. Supervised Topic Models , 2007, NIPS.
[307] E. Allen Emerson,et al. Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[308] Benjamin Thyreau,et al. Discriminative Network Models of Schizophrenia , 2009, NIPS.
[309] Rajeev Alur,et al. Playing Games with Boxes and Diamonds , 2003, CONCUR.
[310] M. R. Osborne,et al. On the LASSO and its Dual , 2000 .
[311] Charles A. Micchelli,et al. Learning the Kernel Function via Regularization , 2005, J. Mach. Learn. Res..
[312] Renato D. C. Monteiro,et al. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..
[313] Massimiliano Pontil,et al. Convex multi-task feature learning , 2008, Machine Learning.
[314] Claude L. Fennema,et al. Scene Analysis Using Regions , 1970, Artif. Intell..
[315] Anthony D. Wagner,et al. Detecting individual memories through the neural decoding of memory states and past experience , 2010, Proceedings of the National Academy of Sciences.
[316] Petros Drineas,et al. CUR matrix decompositions for improved data analysis , 2009, Proceedings of the National Academy of Sciences.
[317] Thomas Deselaers,et al. What is an object? , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[318] Patricia Bouyer,et al. On the Expressiveness of TPTL and MTL , 2005, FSTTCS.
[319] T. B. Boffey. Linear Network Optimization: Algorithms and Codes , 1994 .
[320] Wojciech Jamroga,et al. Comparing Semantics of Logics for Multi-Agent Systems , 2004, Synthese.
[321] S. Mallat. A wavelet tour of signal processing , 1998 .
[322] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[323] Joseph Y. Halpern,et al. “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.
[324] Stephen P. Boyd,et al. Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.
[325] Stavros Tripakis,et al. The Tool KRONOS , 1996, Hybrid Systems.
[326] Stephen J. Wright,et al. Simultaneous Variable Selection , 2005, Technometrics.
[327] Lin Xiao,et al. Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization , 2009, J. Mach. Learn. Res..
[328] Brian Knutson,et al. Interpretable Classifiers for fMRI Improve Prediction of Purchases , 2008, IEEE Transactions on Neural Systems and Rehabilitation Engineering.
[329] Karin Schnass,et al. Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$ -Minimization , 2009, IEEE Transactions on Information Theory.
[330] V. Buldygin,et al. Metric characterization of random variables and random processes , 2000 .
[331] Zhi-Hua Zhou,et al. Adapting RBF Neural Networks to Multi-Instance Learning , 2006, Neural Processing Letters.
[332] Julien Mairal,et al. Proximal Methods for Sparse Hierarchical Dictionary Learning , 2010, ICML.
[333] Francis R. Bach,et al. Structured sparsity-inducing norms through submodular functions , 2010, NIPS.
[334] Francis R. Bach,et al. Self-concordant analysis for logistic regression , 2009, ArXiv.
[335] Peng Zhao,et al. On Model Selection Consistency of Lasso , 2006, J. Mach. Learn. Res..
[336] Masa-aki Sato,et al. Sparse estimation automatically selects voxels relevant for the decoding of fMRI activity patterns , 2008, NeuroImage.
[337] Kim-Chuan Toh,et al. Solving semidefinite-quadratic-linear programs using SDPT3 , 2003, Math. Program..
[338] Paul A. Viola,et al. Multiple Instance Boosting for Object Detection , 2005, NIPS.
[339] Shai Avidan,et al. Spectral Bounds for Sparse PCA: Exact and Greedy Algorithms , 2005, NIPS.
[340] Peter V. Gehler,et al. Deterministic Annealing for Multiple-Instance Learning , 2007, AISTATS.
[341] Jun Wang,et al. Solving the Multiple-Instance Problem: A Lazy Learning Approach , 2000, ICML.
[342] Thomas A. Henzinger,et al. Logics and Models of Real Time: A Survey , 1991, REX Workshop.
[343] Dale Schuurmans,et al. Unsupervised and Semi-Supervised Multi-Class Support Vector Machines , 2005, AAAI.
[344] Yoshua Bengio,et al. Classification using discriminative restricted Boltzmann machines , 2008, ICML '08.
[345] Arkadi Nemirovski,et al. On sparse representation in pairs of bases , 2003, IEEE Trans. Inf. Theory.
[346] Gábor Pataki,et al. On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues , 1998, Math. Oper. Res..
[347] Tomás Lozano-Pérez,et al. Image database retrieval with multiple-instance learning techniques , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[348] Andreas Krause,et al. Submodular Dictionary Selection for Sparse Representation , 2010, ICML.
[349] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[350] Jürgen Dix,et al. Do Agents Make Model Checking Explode (Computationally)? , 2005, CEEMAS.
[351] Jean Ponce,et al. Learning mid-level features for recognition , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[352] Isabelle Guyon,et al. An Introduction to Variable and Feature Selection , 2003, J. Mach. Learn. Res..
[353] R. DeVore,et al. Compressed sensing and best k-term approximation , 2008 .
[354] Stephen J. Wright,et al. Sparse Reconstruction by Separable Approximation , 2008, IEEE Transactions on Signal Processing.
[355] David J. Field,et al. Emergence of simple-cell receptive field properties by learning a sparse code for natural images , 1996, Nature.
[356] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[357] Francis R. Bach,et al. Bolasso: model consistent Lasso estimation through the bootstrap , 2008, ICML '08.
[358] P. Bühlmann,et al. The group lasso for logistic regression , 2008 .
[359] Ryan M. Rifkin,et al. In Defense of One-Vs-All Classification , 2004, J. Mach. Learn. Res..
[360] A. Rinaldo,et al. On the asymptotic properties of the group lasso estimator for linear models , 2008 .
[361] Y. Nesterov. Gradient methods for minimizing composite objective function , 2007 .
[362] Marcin Jurdzinski,et al. Model Checking Probabilistic Timed Automata with One or Two Clocks , 2007, Log. Methods Comput. Sci..
[363] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[364] Eugene Asarin,et al. As Soon as Possible: Time Optimal Control for Timed Automata , 1999, HSCC.
[365] Vladimir Kolmogorov,et al. Cosegmentation Revisited: Models and Optimization , 2010, ECCV.
[366] Karim Lounici. Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators , 2008, 0801.4610.
[367] Jean Ponce,et al. Computer Vision: A Modern Approach , 2002 .
[368] Yong Jae Lee,et al. Collect-cut: Segmentation with top-down cues discovered in multi-object images , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[369] J. Borwein,et al. Convex Analysis And Nonlinear Optimization , 2000 .
[370] Thomas A. Henzinger,et al. Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..
[371] A. Ravishankar Rao,et al. Prediction and interpretation of distributed neural activity with sparse models , 2009, NeuroImage.
[372] Nicolas Markey,et al. Model-Checking Timed , 2006, FORMATS.
[373] Alexei A. Efros,et al. Improving Spatial Support for Objects via Multiple Segmentations , 2007, BMVC.
[374] Lukasz Kaiser,et al. Model Checking Games for the Quantitative μ-Calculus , 2008, Theory of Computing Systems.
[375] Joseph Y. Halpern,et al. Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.
[376] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[377] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[378] Ayhan Demiriz,et al. Semi-Supervised Support Vector Machines , 1998, NIPS.
[379] P. L. Combettes,et al. Solving monotone inclusions via compositions of nonexpansive averaged operators , 2004 .
[380] A. Kleinschmidt,et al. Graded size sensitivity of object-exemplar-evoked activity patterns within human LOC subregions. , 2008, Journal of neurophysiology.
[381] Karl J. Friston,et al. Statistical parametric maps in functional imaging: A general linear approach , 1994 .
[382] Jerome M. Shapiro,et al. Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..
[383] Amnon Shashua,et al. Nonnegative Sparse PCA , 2006, NIPS.