312 results on '"Piotr Berman"'
Search Results
2. Testing Connectedness of Images.
3. Tolerant Testers of Image Properties.
4. Testing convexity of figures under the uniform distribution.
5. The Power and Limitations of Uniform Samples in Testing Properties of Figures.
6. Tolerant Testers of Image Properties.
7. The Power and Limitations of Uniform Samples in Testing Properties of Figures.
8. Testing Convexity of Figures Under the Uniform Distribution.
9. Lp-testing.
10. Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs.
11. Improving the performance of k-means clustering through computation skipping and data locality optimizations.
12. Improved Approximation for the Directed Spanner Problem.
13. Steiner Transitive-Closure Spanners of Low-Dimensional Posets.
14. HybridStore: A Cost-Efficient, High-Performance Storage System Combining SSDs and HDDs.
15. O(1)-Approximations for Maximum Movement Problems.
16. Finding Sparser Directed Spanners.
17. A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2.
18. Efficient Alignments of Metabolic Networks with Bounded Treewidth.
19. Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems.
20. Approximation Algorithms for Min-Max Generalization Problems.
21. Aligning Two Genomic Sequences That Contain Duplications.
22. 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2.
23. Approximating Transitive Reductions for Directed Networks.
24. HCV Quasispecies Assembly Using Network Flows.
25. Fast Alignments of Metabolic Networks.
26. Packing to angles and sectors.
27. Faster Approximation of Distances in Graphs.
28. Bringing Folding Pathways into Strand Pairing Prediction.
29. Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees.
30. 8/7-approximation algorithm for (1, 2)-TSP.
31. Controlling Size When Aligning Multiple Genomic Sequences with Duplications.
32. A Linear-Time Algorithm for Studying Genetic Variation.
33. Optimizing sensor movement planning for energy efficiency.
34. Optimal Trade-Off for Merkle Tree Traversal.
35. On the Vehicle Routing Problem.
36. Approximating the Online Set Multicover Problems via Randomized Winnowing.
37. Tight Approximability Results for Test Set Problems in Bioinformatics.
38. The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.
39. Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks.
40. Power efficient monitoring management in sensor networks.
41. Approximation Algorithms for Min-Max Generalization Problems.
42. Steiner transitive-closure spanners of low-dimensional posets.
43. HybridPlan: a capacity planning technique for projecting storage requirements in hybrid storage systems.
44. On the Computational Complexity of Measuring Global Stability of Banking Networks.
45. Optimizing misdirection.
46. Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION.
47. Approximating Huffman Codes in Parallel.
48. 1.375-Approximation Algorithm for Sorting by Reversals.
49. Slice and dice: a simple, improved approximate tiling recipe.
50. Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.