Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Contradiction Detection (CD) in text is a difficult NLP task. We investigate CD over functions (e.g., BornIn(Person)=Place), and present a domain-independent algorithm that automa...
Alan Ritter, Stephen Soderland, Doug Downey, Oren ...
Abstract. Understanding the challenges faced by real projects in evolving variability models, is a prerequisite for providing adequate support for such undertakings. We study the e...
Rafael Lotufo, Steven She, Thorsten Berger, Krzysz...
People form consistent impressions of others given surprisingly little information. With the advent of social networks, impressions now may form online rather than in a face-to-fa...