Sciweavers

1225 search results - page 48 / 245
» Maximal Consistent Subsets
Sort
View
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
14 years 1 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
3DPVT
2004
IEEE
119views Visualization» more  3DPVT 2004»
13 years 11 months ago
Synthetic Image of Multiresolution Sketch Leads to New Features
A new approach to construction of robust features is proposed and applied to an instance of the correspondence problem. The main idea is to construct a synthetic image by a multir...
Georgii Khachaturov, Rafael Moncayo-Muños
GCB
2000
Springer
99views Biometrics» more  GCB 2000»
13 years 11 months ago
Structure Motif Discovery and Mining the PDB
We describe an algorithm for the automatic discovery of recurring patterns in protein structures. The patterns consist of individual residues having a defined order along the prote...
Inge Jonassen, Ingvar Eidhammer, Darrell Conklin, ...
FORTE
1998
13 years 9 months ago
Hardware synthesis from protocol specifications in LOTOS
: In this paper, we propose a technique for hardware implementation of protocol specifications in LOTOS. For the purpose, we define a new model called synchronous EFSMs consisting ...
Keiichi Yasumoto, Akira Kitajima, Teruo Higashino,...
JMLR
2006
113views more  JMLR 2006»
13 years 7 months ago
Learning the Structure of Linear Latent Variable Models
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
Ricardo Silva, Richard Scheines, Clark Glymour, Pe...