Sciweavers

5046 search results - page 946 / 1010
» Feature Selection from Huge Feature Sets
Sort
View
NAR
2011
223views Computer Vision» more  NAR 2011»
14 years 8 months ago
ODB: a database for operon organizations, 2011 update
ODB (Operon DataBase) aims to collect data of all known and conserved operons in completely sequenced genomes. Three newly updated features of this database have been added as fol...
Shujiro Okuda, Akiyasu C. Yoshizawa
AAAI
2012
13 years 8 months ago
Transportability of Causal Effects: Completeness Results
The study of transportability aims to identify conditions under which causal information learned from experiments can be reused in a different environment where only passive obser...
Elias Bareinboim, Judea Pearl
CVPR
2000
IEEE
16 years 8 months ago
Improving Visual Matching
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...
Michael S. Lew, Nicu Sebe, Thomas S. Huang
CVPR
2001
IEEE
16 years 8 months ago
On Solving 2D and 3D Puzzles Using Curve Matching
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
Weixin Kong, Benjamin B. Kimia
ICML
2004
IEEE
16 years 6 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall