Sciweavers

338 search results - page 48 / 68
» Approximation Spaces and Information Granulation
Sort
View
123
Voted
ANCS
2009
ACM
14 years 7 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
CVPR
2004
IEEE
15 years 11 months ago
MetaMorphs: Deformable Shape and Texture Models
We present a new class of deformable models, MetaMorphs, whose formulation integrates both shape and interior texture. The model deformations are derived from both boundary and re...
Xiaolei Huang, Dimitris N. Metaxas, Ting Chen
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 3 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
BMCBI
2006
125views more  BMCBI 2006»
14 years 9 months ago
Automated functional classification of experimental and predicted protein structures
Background: Proteins that are similar in sequence or structure may perform different functions in nature. In such cases, function cannot be inferred from sequence or structural si...
Kai Wang, Ram Samudrala
PRL
2007
138views more  PRL 2007»
14 years 9 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh