We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian...
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...