Sciweavers

2208 search results - page 107 / 442
» On Issues of Instance Selection
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
OTM
2009
Springer
14 years 4 months ago
A Model for Semantic Equivalence Discovery for Harmonizing Master Data
IT projects often face the challenge of harmonizing metadata and data so as to have a “single” version of the truth. Determining equivalency of multiple data instances against ...
Baba Piprani
AIMSA
2008
Springer
14 years 4 months ago
Prototypes Based Relational Learning
Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for c...
Rocío García-Durán, Fernando ...
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
14 years 2 months ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya
CSB
2004
IEEE
149views Bioinformatics» more  CSB 2004»
14 years 1 months ago
Weighting Features to Recognize 3D Patterns of Electron Density in X-Ray Protein Crystallography
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
Kreshna Gopal, Tod D. Romo, James C. Sacchettini, ...