Sciweavers

171 search results - page 26 / 35
» Can We Get A Better Retrieval Function From Machine
Sort
View
PODS
1999
ACM
151views Database» more  PODS 1999»
13 years 11 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
INFORMS
1998
100views more  INFORMS 1998»
13 years 6 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
SMI
2005
IEEE
14 years 18 days ago
Curvature Maps for Local Shape Comparison
— The ability to identify similarities between shapes is important for applications such as medical diagnosis, object registration and alignment, and shape retrieval. In this pap...
Timothy Gatzke, Cindy Grimm, Michael Garland, Stev...
BMCBI
2007
143views more  BMCBI 2007»
13 years 7 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
TNN
2010
148views Management» more  TNN 2010»
13 years 1 months ago
Generalized low-rank approximations of matrices revisited
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
Jun Liu, Songcan Chen, Zhi-Hua Zhou, Xiaoyang Tan