Kernelized sorting is an approach for matching objects from two sources (or domains) that does not require any prior notion of similarity between objects across the two sources. U...
Jagadeesh Jagarlamudi, Seth Juarez, Hal Daum&eacut...
At the Human Computer Interaction Lab (HCILab) at UNC Charlotte, we investigate novel ways for people to interact with computers, and through computers with their environments. Ou...
The Seldon model combines concepts from agent-based modeling and social network analysis to create a computation model of social dynamics for terrorist recruitment. The underlying...
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...