Geometry of planar graphs with angles
SCG '86 Proceedings of the second annual symposium on Computational geometry
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A VLSI Implementation of the Simplex Algorithm
IEEE Transactions on Computers
Dependence of multi-dimensional array references
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Control strategies for two-player games
ACM Computing Surveys (CSUR)
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Reasoning about systems with many processes
Journal of the ACM (JACM)
An applicable test data generation algorithm for domain errors
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Use of Petri net invariants to detect static deadlocks in Ada programs
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
The Earth Mover's Distance as a Metric for Image Retrieval
International Journal of Computer Vision
An Efficient Data Dependence Analysis for Parallelizing Compilers
IEEE Transactions on Parallel and Distributed Systems
Timed Verification of Asynchronous Circuits
Concurrency and Hardware Design, Advances in Petri Nets
Proceedings of the 15th international conference on World Wide Web
An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison
IEEE Transactions on Pattern Analysis and Machine Intelligence
A novel document similarity measure based on earth mover's distance
Information Sciences: an International Journal
Journal of Parallel and Distributed Computing
Red-blue covering problems and the consecutive ones property
Journal of Discrete Algorithms
A polynomial-time algorithm for linear optimization based on a new class of kernel functions
Journal of Computational and Applied Mathematics
Planning under risk and Knightian uncertainty
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
An optimal design method for de-synchronous circuit based on control graph
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Fast reflexive arithmetic tactics the linear case and beyond
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Enumeration and exact design of weighted voting games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Untangling the cross-lingual link structure of Wikipedia
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Annotated probabilistic temporal logic
ACM Transactions on Computational Logic (TOCL)
Artifact systems with data dependencies and arithmetic
Proceedings of the 14th International Conference on Database Theory
Journal of Computational and Applied Mathematics
Beyond convexity: new perspectives in computational optimization
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Multi-agent role allocation: issues, approaches, and multiple perspectives
Autonomous Agents and Multi-Agent Systems
The cost of traveling between languages
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Near-optimal no-regret algorithms for zero-sum games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Path schematization for route sketches
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Using proportional transportation distances for measuring document similarity
ECIR'06 Proceedings of the 28th European conference on Advances in Information Retrieval
ViNEYard: virtual network embedding algorithms with coordinated node and link mapping
IEEE/ACM Transactions on Networking (TON)
Journal of Computational and Applied Mathematics
Artifact systems with data dependencies and arithmetic
ACM Transactions on Database Systems (TODS)
Lifetime aware deployment of k base stations in WSNs
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
On the communication complexity of approximate nash equilibria
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Real-Time Tactical and Strategic Sales Management for Intelligent Agents Guided by Economic Regimes
Information Systems Research
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Note: On the complexity of quantified linear systems
Theoretical Computer Science
| Hi-index | 0.01 |
We present a new polynomial-time algorithm for linear programming. The running-time of this algorithm is O(n3-5L2), as compared to O(n6L2) for the ellipsoid algorithm. We prove that given a polytope P and a strictly interior point a &egr; P, there is a projective transformation of the space that maps P, a to P', a' having the following property. The ratio of the radius of the smallest sphere with center a', containing P' to the radius of the largest sphere with center a' contained in P' is O (n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial-time.