Sciweavers

74 search results - page 14 / 15
» Algorithms for Generating Convex Sets in Acyclic Digraphs
Sort
View
JMLR
2010
103views more  JMLR 2010»
13 years 22 days ago
Learning Nonlinear Dynamic Models from Non-sequenced Data
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
Tzu-Kuo Huang, Le Song, Jeff Schneider
MP
2008
135views more  MP 2008»
13 years 5 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
NAR
2008
175views more  NAR 2008»
13 years 5 months ago
Onto-CC: a web server for identifying Gene Ontology conceptual clusters
The Gene Ontology (GO) vocabulary has been extensively explored to analyze the functions of coexpressed genes. However, despite its extended use in Biology and Medical Sciences, t...
Rocío Romero-Záliz, Coral del Val, J...
CVIU
2006
222views more  CVIU 2006»
13 years 6 months ago
Conditional models for contextual human motion recognition
We present algorithms for recognizing human motion in monocular video sequences, based on discriminative Conditional Random Field (CRF) and Maximum Entropy Markov Models (MEMM). E...
Cristian Sminchisescu, Atul Kanaujia, Dimitris N. ...
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 4 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi