Showing 1–20 of 22 results
/ Date/ Name
Mar 10, 2026InternVL-U: Democratizing Unified Multimodal Models for Understanding, Reasoning, Generation and EditingFeb 3, 2026Minimizing Makespan in Sublinear Time via Weighted Random SamplingAug 25, 2025InternVL3.5: Advancing Open-Source Multimodal Models in Versatility, Reasoning, and EfficiencySep 3, 2024Blocks as Probes: Dissecting Categorization Ability of Large Multimodal ModelsJan 31, 2023Sublinear Approximation Schemes for Scheduling Precedence Graphs of Bounded DepthApr 5, 2022Streaming Approximation Scheme for Minimizing Total Completion Time on Parallel Machines Subject to Varying Processing CapacityApr 5, 2022Streaming Algorithms for Multitasking Scheduling with Shared ProcessingApr 4, 2022Multitasking Scheduling with Shared ProcessingMar 2, 2020Hardness of Sparse Sets and Minimal Circuit Size ProblemAug 13, 2018Speeding Up Constrained $k$-Means Through 2-MeansJun 15, 2018Polyhedra Circuits and Their ApplicationsFeb 17, 2018Approximate Set Union Via Approximate RandomizationAug 26, 2017A Model for Donation VerificationNov 11, 2013Derandomizing Polynomial Identity over Finite Fields Implies Super-Polynomial Circuit Lower Bounds for NEXPFeb 29, 2012Sublinear Time Approximate Sum via Uniform Random SamplingDec 2, 2011On the Complexity of Approximate Sum of Sorted ListDec 10, 2010NE is not NP Turing Reducible to Nonexpoentially Dense NP SetsDec 10, 2010Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NPJul 15, 2010The Complexity of Testing Monomials in Multivariate PolynomialsJul 15, 2010XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme