This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
We consider the relationship between size and depth for layered Boolean circuits, synchronous circuits and planar circuits as well as classes of circuits with small separators. In ...
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
Abstract The LLL algorithm aims at finding a “reduced” basis of a Euclidean lattice. The LLL algorithm plays a primary role in many areas of mathematics and computer science. ...
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
A. Falappa, an Abstract Dialogue Framework Guillermo R. Simari Regular Helena Kein¨anen An Algorithm for Generating Nash Stable Coalition Structures in Hedonic Games 15:30-16:00 A...
The current web is a web of linked pages. Frustrated users search for facts by guessing which keywords or keyword phrases might lead them to pages where they can find facts. Can w...
Search engines have become a central part of the internet marketing strategy of tourism businesses and, as such, it is essential that destination marketing organizations have a su...
Daniel R. Fesenmaier, Zheng Xiang, Bing Pan, Rob L...