42 results on '"partition tree"'
Search Results
2. Advice Complexity
3. Reference Point Hyperplane Trees
4. Tensor Spaces and Hierarchical Tensor Representations
5. Query Retrieval of Combinations with Sum-of-Subsets Ranking
6. Quicksort and Large Deviations
7. Designing Scalable Parallel SAT Solvers
8. Harmonic Analysis of Digital Data Bases
9. Grid-Based SAT Solving with Iterative Partitioning and Clause Learning
10. On Rectilinear Partitions with Minimum Stabbing Number
11. Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures
12. Partitioning SAT Instances for Distributed Solving
13. Unstructured Peer-to-Peer Resource Space
14. Decision Analysis of Fuzzy Partition Tree Applying AIC and Fuzzy Decision
15. Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
16. Knowledge Discovery in Fuzzy Databases Using Attribute-Oriented Induction
17. The Fuzzy Clustering Algorithm Based on AFS Topology
18. On Interpretation of Non-atomic Values and Induction of Decision Rules in Fuzzy Relational Databases
19. Polyline Fitting of Planar Points Under Min-sum Criteria
20. Generation of Sentence Parse Trees Using Parts of Speech
21. Approximate Unions of Lines and Minkowski Sums
22. Fixed-Location Circular-Arc Drawing of Planar Graphs
23. Validity Information Retrieval for Spatio-Temporal Queries: Theoretical Performance Bounds
24. An Efficient Indexing Scheme for Multi-dimensional Moving Objects
25. Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D
26. Simulation Revisited
27. Simplex Range Searching : Windowing Revisited
28. Fast floorplanning for FPGAs
29. Using sparsification for parametric minimum spanning tree problems
30. On minimum 3-cuts and approximating k-cuts using Cut Trees
31. On set equality-testing
32. Quantitative empirical modeling for managing software development: Constraints, needs and solutions
33. Preliminaries
34. Introduction
35. Ray shooting from a fixed point
36. Epsilon-Nets and Computational Geometry
37. Lower bounds on the complexity of simplex range reporting on a pointer machine : Extended abstract
38. Dynamic partition trees
39. (L̂2,Ŝ2)—adapted graphs
40. Fast parallel vertex colouring
41. Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
42. Methods in the analysis of algorithms : Evaluations of a recursive partitioning process
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.