Sciweavers

526 search results - page 53 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
APWEB
2005
Springer
15 years 9 months ago
An Incremental Subspace Learning Algorithm to Categorize Large Scale Text Data
The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we pr...
Jun Yan, QianSheng Cheng, Qiang Yang, Benyu Zhang
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
15 years 7 months ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
ICCV
2009
IEEE
16 years 9 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
IPPS
1998
IEEE
15 years 8 months ago
High Performance Data Mining Using Data Cubes on Parallel Computers
On-Line Analytical Processing techniques are used for data analysis and decision support systems. The multidimensionality of the underlying data is well represented by multidimens...
Sanjay Goil, Alok N. Choudhary
GECCO
2003
Springer
15 years 9 months ago
DNA-Like Genomes for Evolution in silico
We explore the advantages of DNA-like genomes for evolutionary computation in silico. Coupled with simulations of chemical reactions, these genomes offer greater efficiency, reliab...
Michael West, Max H. Garzon, Derrel Blain