The SCEAS System
| |||||||

## Search the dblp DataBase
Luís G. Rueda:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Luís G. Rueda, B. John Oommen
**On Families of New Adaptive Compression Algorithms Suitable for Time-Varying Source Data.**[Citation Graph (0, 0)][DBLP] ADVIS, 2004, pp:234-244 [Conf] - Luís G. Rueda, B. John Oommen
**Resolving Minsky's Paradox: The d-Dimensional Normal Distribution Case.**[Citation Graph (0, 0)][DBLP] Australian Joint Conference on Artificial Intelligence, 2001, pp:25-36 [Conf] - Luís G. Rueda
**A New Approach That Selects a Single Hyperplane from the Optimal Pairwise Linear Classifier.**[Citation Graph (0, 0)][DBLP] CIARP, 2003, pp:521-528 [Conf] - Luís G. Rueda
**New Bounds and Approximations for the Error of Linear Classifiers.**[Citation Graph (0, 0)][DBLP] CIARP, 2004, pp:342-349 [Conf] - B. John Oommen, Luís G. Rueda
**Histogram Methods in Query Optimization: The Relation between Accuracy and Optimality.**[Citation Graph (0, 0)][DBLP] DASFAA, 2001, pp:320-326 [Conf] - Luís G. Rueda, Li Qin
**An Improved Clustering-Based Approach for DNA Microarray Image Segmentation.**[Citation Graph (0, 0)][DBLP] ICIAR (2), 2004, pp:17-24 [Conf] - Luís G. Rueda, Li Qin
**A New Method for DNA Microarray Image Segmentation.**[Citation Graph (0, 0)][DBLP] ICIAR, 2005, pp:886-893 [Conf] - Luís G. Rueda, Vidya Vidyadharan
**A New Approach to Automatically Detecting Grids in DNA Microarray Images.**[Citation Graph (0, 0)][DBLP] ICIAR, 2005, pp:982-989 [Conf] - Luís G. Rueda, B. John Oommen
**Efficient Adaptive Data Compression Using Fano Binary Search Trees.**[Citation Graph (0, 0)][DBLP] ISCIS, 2005, pp:768-779 [Conf] - B. John Oommen, Luís G. Rueda
**On Utilizing Stochastic Learning Weak Estimators for Training and Classification of Patterns with Non-stationary Distributions.**[Citation Graph (0, 0)][DBLP] KI, 2005, pp:107-120 [Conf] - B. John Oommen, Luís G. Rueda
**Using Pattern Recognition Techniques to Derive a Formal Analysis of Why Heuristics Functions Work.**[Citation Graph (0, 0)][DBLP] PRIS, 2002, pp:45-58 [Conf] - Luís G. Rueda
**An Empirical Analysis of Traditional and Optimal Pairwise Linear Classifiers on Standard Benchmarks.**[Citation Graph (0, 0)][DBLP] PRIS, 2003, pp:88-95 [Conf] - B. John Oommen, Luís G. Rueda
**A New Family of Weak Estimators for Training in Non-stationary Distributions.**[Citation Graph (0, 0)][DBLP] SSPR/SPR, 2004, pp:644-652 [Conf] - B. John Oommen, Luís G. Rueda
**A formal analysis of why heuristic functions work.**[Citation Graph (0, 0)][DBLP] Artif. Intell., 2005, v:164, n:1-2, pp:1-22 [Journal] - B. John Oommen, Luís G. Rueda
**The Efficiency of Histogram-like Techniques for Database Query Optimization.**[Citation Graph (0, 0)][DBLP] Comput. J., 2002, v:45, n:5, pp:494-510 [Journal] - Luís G. Rueda, B. John Oommen
**A nearly-optimal Fano-based coding algorithm.**[Citation Graph (0, 0)][DBLP] Inf. Process. Manage., 2004, v:40, n:2, pp:257-268 [Journal] - Luís G. Rueda, B. John Oommen
**On Optimal Pairwise Linear Classifiers for Normal Distributions: The Two-Dimensional Case.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Pattern Anal. Mach. Intell., 2002, v:24, n:2, pp:274-280 [Journal] - Luís G. Rueda
**An efficient approach to compute the threshold for multi-dimensional linear classifiers.**[Citation Graph (0, 0)][DBLP] Pattern Recognition, 2004, v:37, n:4, pp:811-826 [Journal] - Luís G. Rueda, B. John Oommen
**On optimal pairwise linear classifiers for normal distributions: the d-dimensional case.**[Citation Graph (0, 0)][DBLP] Pattern Recognition, 2003, v:36, n:1, pp:13-23 [Journal] - Luís G. Rueda
**Selecting the best hyperplane in the framework of optimal pairwise linear classifiers.**[Citation Graph (0, 0)][DBLP] Pattern Recognition Letters, 2004, v:25, n:1, pp:49-62 [Journal]
Search in 0.004secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |