Applications of Gro¨bner bases in non-linear computational geometry
Trends in computer algebra
SIAM Journal on Computing
Maintenance of geometric extrema ∈
Journal of the ACM (JACM)
A heuristic selection strategy for lexicographic Gröner bases?
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
“One sugar cube, please” or selection strategies in the Buchberger algorithm
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
An optimal algorithm for the on-line closest-pair problem
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Maintaining the minimal distance of a point set in polylogarithmic time
Discrete & Computational Geometry
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized data structures for the dynamic closest-pair problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On the approximability of numerical taxonomy (fitting distances by tree metrics)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
New techniques for some dynamic closest-point and farthest-point problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Experiments on traveling salesman heuristics
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Clustering Algorithms
The First Subquadratic Algorithm for Complete Linkage Clustering
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Incremental and decremental maintenance of planar width
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
When crossings count — approximating the minimum spanning tree
Proceedings of the sixteenth annual symposium on Computational geometry
Finding approximate shape regularities in reverse engineered solid models bounded by simple surfaces
Proceedings of the sixth ACM symposium on Solid modeling and applications
C2P: Clustering based on Closest Pairs
Proceedings of the 27th International Conference on Very Large Data Bases
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
A Monotonic On-Line Linear Algorithm for Hierarchical Agglomerative Classification
Information Technology and Management
HARP: A Practical Projected Clustering Algorithm
IEEE Transactions on Knowledge and Data Engineering
Identifying projected clusters from gene expression profiles
Journal of Biomedical Informatics
An optimal hierarchical clustering algorithm for gene expression data
Information Processing Letters
Reversible Data Hiding in the VQ-Compressed Domain
IEICE - Transactions on Information and Systems
Bayesian k-Means as a "Maximization-expectation" algorithm
Neural Computation
An optimal hierarchical clustering algorithm for gene expression data
Information Processing Letters
A new HMM-based ensemble generation method for numeral recognition
MCS'07 Proceedings of the 7th international conference on Multiple classifier systems
Unnecessary image pair detection for a large scale reconstruction
ICEC'10 Proceedings of the 9th international conference on Entertainment computing
BitShred: feature hashing malware for scalable triage and semantic analysis
Proceedings of the 18th ACM conference on Computer and communications security
Coresets for discrete integration and clustering
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Speeding-Up hierarchical agglomerative clustering in presence of expensive metrics
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Towards discovery of subgraph bisociations
Bisociative Knowledge Discovery
| Hi-index | 0.00 |