Mining optimized association rules for numeric attributes
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficiency in the APL environment—a full arsenal for attacking CPU hogs
APL '85 Proceedings of the international conference on APL: APL and the future
An introduction to STSC's APL compiler
APL '85 Proceedings of the international conference on APL: APL and the future
Algorithms for the maximum subarray problem based on matrix multiplication
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Data Mining with optimized two-dimensional association rules
ACM Transactions on Database Systems (TODS)
Computing Optimal Hypotheses Efficiently for Boosting
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Mining Asynchronous Periodic Patterns in Time Series Data
IEEE Transactions on Knowledge and Data Engineering
Foundations of data-parallel skeletons
Patterns and skeletons for parallel and distributed computing
Transforming rapid prototypes to efficient parallel programs
Patterns and skeletons for parallel and distributed computing
Parallelizing functional programs by generalization
Journal of Functional Programming
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Algorithms, design and classification of
Encyclopedia of Computer Science
Information Processing Letters
Improved algorithmms for the k maximum-sums problems
Theoretical Computer Science
Randomized algorithm for the sum selection problem
Theoretical Computer Science
Theoretical Computer Science
On the range maximum-sum segment query problem
Discrete Applied Mathematics
Optimal algorithms for the average-constrained maximum-sum segment problem
Information Processing Letters
Bichromatic separability with two boxes: A general approach
Journal of Algorithms
A compositional framework for developing parallel programs on two-dimensional arrays
International Journal of Parallel Programming
Information Processing Letters
Efficient algorithms for the sum selection problem and k maximum sums problem
Theoretical Computer Science
International Journal of Bioinformatics Research and Applications
Effect of corner information in simultaneous placement of K rectangles and tableaux
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Automatic rule refinement for information extraction
Proceedings of the VLDB Endowment
Solving the maximum subsequence problem with a hardware agents-based system
ICC'06 Proceedings of the 10th WSEAS international conference on Circuits
Fast PRISM: Branch and Bound Hough Transform for Object Class Detection
International Journal of Computer Vision
Real-time human action search using random forest based hough voting
MM '11 Proceedings of the 19th ACM international conference on Multimedia
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Rounding of sequences and matrices, with applications
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Improved algorithms for the K-maximum subarray problem for small K
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Algorithm for K disjoint maximum subarrays
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Computing maximum-scoring segments in almost linear time
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Randomized algorithm for the sum selection problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Improved algorithms for the k maximum-sums problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Efficient algorithms for k maximum sums
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the range maximum-sum segment query problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient algorithms for the sum selection problem and k maximum sums problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Finding maximum sum segments in sequences with uncertainty
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Algorithms for computing the maximum weight region decomposable into elementary shapes
Computer Vision and Image Understanding
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
On the coarseness of bicolored point sets
Computational Geometry: Theory and Applications
A linear time algorithm for the k maximal sums problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Robust optimization in the presence of uncertainty
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Journal of Discrete Algorithms
Object class detection: A survey
ACM Computing Surveys (CSUR)
Hi-index | 48.22 |