Sciweavers

923 search results - page 119 / 185
» The Computational Structure of Progress Conditions
Sort
View
ECCV
2010
Springer
15 years 2 months ago
Critical Nets and Beta-Stable Features for Image Matching
Abstract. We propose new ideas and efficient algorithms towards bridging the gap between bag-of-features and constellation descriptors for image matching. Specifically, we show ho...
ACL
2010
14 years 7 months ago
Practical Very Large Scale CRFs
Conditional Random Fields (CRFs) are a widely-used approach for supervised sequence labelling, notably due to their ability to handle large description spaces and to integrate str...
Thomas Lavergne, Olivier Cappé, Franç...
ICCV
2011
IEEE
13 years 9 months ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...
CIKM
2007
Springer
15 years 4 months ago
Regularized locality preserving indexing via spectral regression
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He, Wei Vivian Zhang, Jiawei Han
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
15 years 4 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska