@conference {12483,
	title = {Fast directional chamfer matching},
	booktitle = {Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on},
	year = {2010},
	month = {2010/06//},
	pages = {1696 - 1703},
	abstract = {We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been proposed for the problem over the decades, chamfer matching remains to be the preferred method when speed and robustness are considered. In this paper, we significantly improve the accuracy of chamfer matching while reducing the computational time from linear to sublinear (shown empirically). Specifically, we incorporate edge orientation information in the matching algorithm such that the resulting cost function is piecewise smooth and the cost variation is tightly bounded. Moreover, we present a sublinear time algorithm for exact computation of the directional chamfer matching score using techniques from 3D distance transforms and directional integral images. In addition, the smooth cost function allows to bound the cost distribution of large neighborhoods and skip the bad hypotheses within. Experiments show that the proposed approach improves the speed of the original chamfer matching upto an order of 45 $\#$x00D7;, and it is much faster than many state of art techniques while the accuracy is comparable.},
	keywords = {3D, algorithm;edge, algorithms;single, chamfer, cost, detection;image, directional, distance, distribution;cost, example;smooth, function;sublinear, hand-drawn, images;edge, information;fast, integral, localization, MATCHING, matching;gallery, matching;transforms;, model;piecewise, of, orientation, problem;object, score;directional, shapes;object, smooth;shape, TIME, time;cost, transforms;computational, variation;directional},
	doi = {10.1109/CVPR.2010.5539837},
	author = {Ming-Yu Liu and Tuzel, O. and Veeraraghavan,A. and Chellapa, Rama}
}
@conference {13108,
	title = {Assigning cameras to subjects in video surveillance systems},
	booktitle = {Robotics and Automation, 2009. ICRA {\textquoteright}09. IEEE International Conference on},
	year = {2009},
	month = {2009/05//},
	pages = {837 - 843},
	abstract = {We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we construct a separate narrow field of view video for as many people as possible, by stitching together video segments from multiple cameras over time. We employ a novel approach to assign cameras to people as a function of time, with camera switches when needed. The problem is modeled as a bipartite graph and the solution corresponds to a maximum matching. As people move, the solution is efficiently updated by computing an augmenting path rather than by solving for a new matching. This reduces computation time by an order of magnitude. In addition, solving for the shortest augmenting path minimizes the number of camera switches at each update. When not all people can be covered by the available cameras, we cluster as many people as possible into small groups, then assign cameras to groups using a minimum cost matching algorithm. We test our method using numerous runs from different simulators.},
	keywords = {agent, algorithm;multiple, assignment;computation, augmenting, cameras;video, cost, detection;video, graph;camera, MATCHING, matching;minimum, matching;target, path;bipartite, reduction;maximum, segment;video, Surveillance, surveillance;, system;graph, theory;image, TIME, tracking;obstacle, tracking;video, video},
	doi = {10.1109/ROBOT.2009.5152753},
	author = {El-Alfy,H. and Jacobs, David W. and Davis, Larry S.}
}
@article {12242,
	title = {A Unified Framework for Multipath Routing for Unicast and Multicast Traffic},
	journal = {Networking, IEEE/ACM Transactions on},
	volume = {16},
	year = {2008},
	month = {2008/10//},
	pages = {1038 - 1051},
	abstract = {We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the gradient of the network cost function is not available and needs to be estimated. Multiple paths are provided between a source and a destination using application-layer overlay. We propose a novel algorithm that is based on what is known as simultaneous perturbation stochastic approximation and utilizes only noisy measurements collected and reported to the sources, using an overlay architecture. We consider three network models that reflect different sets of assumptions regarding multicast capabilities of the network. Using an analytical model we first prove the almost sure convergence of the algorithm to a corresponding optimal solution under each network model considered in this paper with decreasing step sizes. Then, we establish the weak convergence (or convergence in distribution) with a fixed step size. In addition, we investigate the benefits acquired from implementing additional multicast capabilities by studying the relative performance of our algorithm under the three network models.},
	keywords = {application-layer, approximation;unicast, balancing;multicast, channels;stochastic, communication;multipath, cost, function;optimization, network, overlay;load, perturbation, problem;simultaneous, processes;telecommunication, routing;network, routing;telecommunication, Stochastic, traffic;, traffic;multicast, traffic;multipath},
	isbn = {1063-6692},
	doi = {10.1109/TNET.2007.909686},
	author = {Guven,T. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby}
}
@conference {18689,
	title = {Proteus: a flexible infrastructure to implement adaptive fault tolerance in AQuA},
	year = {1999},
	month = {1999/11//},
	pages = {149 - 168},
	abstract = {Building dependable distributed systems from commercial off-the-shelf components is of growing practical importance. For both cost and production reasons, there is interest in approaches and architectures that facilitate building such systems. The AQuA architecture is one such approach; its goal is to provide adaptive fault tolerance to CORBA applications by replicating objects, providing a high-level method for applications to specify their desired dependability, and providing a dependability manager that attempts to reconfigure a system at runtime so that dependability requests are satisfied. This paper describes how dependability is provided in AQuA. In particular it describes Proteus, the part of AQuA that dynamically manages replicated distributed objects to make them dependable. Given a dependability request, Proteus chooses a fault tolerance approach and reconfigures the system to try to meet the request. The infrastructure of Proteus is described in this paper, along with its use in implementing active replication and a simple dependability policy},
	keywords = {adaptive fault tolerance, AQuA, commercial off-the-shelf components, CORBA applications, cost, dependable distributed systems, distributed object management, object replication, proteus, reconfigurable architectures, Runtime, Software architecture, software fault tolerance},
	doi = {10.1109/DCFTS.1999.814294},
	author = {Sabnis,C. and Michel Cukier and Ren,J. and Rubel,P. and Sanders,W. H. and Bakken,D. E. and Karr,D.}
}
@conference {15207,
	title = {Efficient minimum cost matching using quadrangle inequality},
	booktitle = {Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on},
	year = {1992},
	month = {1992/10//},
	pages = {583 - 592},
	abstract = {The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red cup; Blue, Red times; Blue), where |Red| = n, |Blue| = m, n les; m, and the cost function obeys the quadrangle inequality. The first results assume that all the red points and all the blue points lie on a curve that is homeomorphic to either a line or a circle and the cost function is given by the Euclidean distance along the curve. They present a linear time algorithm for the matching problem. They generalize the method to solve the corresponding transportation problem in O((m+n)log(m+n)) time. The next result is an O(n log m) algorithm for minimum cost matching when the cost array is a bitonic Monge array. An example of this is when the red points lie on one straight line and the blue points lie on another straight line (that is not necessarily parallel to the first one). Finally, they provide a weakly polynomial algorithm for the transportation problem in which the associated cost array is a bitonic Monge array},
	keywords = {algorithm;, array;, bipartite, bitonic, blue, complexity;, computational, cost, distance;, Euclidean, function;, geometry;, graph, graphs;, inequality;, linear, MATCHING, matching;, minimisation;, minimum, Monge, perfect, points;, polynomial, problem;, quadrangle, red, theory;, TIME, transportation, transportation;, weakly},
	doi = {10.1109/SFCS.1992.267793},
	author = {Aggarwal,A. and Bar-Noy,A. and Khuller, Samir and Kravets,D. and Schieber,B.}
}
@conference {18373,
	title = {An improved classification tree analysis of high cost modules based upon an axiomatic definition of complexity},
	booktitle = {Software Reliability Engineering, 1992. Proceedings., Third International Symposium on},
	year = {1992},
	month = {1992/10//},
	pages = {164 - 172},
	abstract = {Identification of high cost modules has been viewed as one mechanism to improve overall system reliability, since such modules tend to produce more than their fair share of problems. A decision tree model has previously been used to identify such modules. In this paper, a previously developed axiomatic model of program complexity is merged with the previously developed decision tree process for an improvement in the ability to identify such modules. This improvement has been tested using data from the NASA Software Engineering Laboratory},
	keywords = {(mathematics);, analysis;, axiomatic, classification, classification;, complexity;, computational, cost, decision, definition;, high, metrics;, model;, modules;, overall, program, reliability;, software, subroutines;, system, tree, TREES},
	doi = {10.1109/ISSRE.1992.285848},
	author = {Tian,Jianhui and Porter, Adam and Zelkowitz, Marvin V}
}
