We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
Paul Christiano, Jonathan A. Kelner, Aleksander Ma...
We conducted an ethnographic field study examining how a building design team used representational artifacts to coordinate the design of building systems, structure, and architect...
Melanie Tory, Sheryl Staub-French, Barry A. Po, Fu...
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
This paper examines the identification of multi-input systems. Motivated by an experiment design problem (should one excite the various inputs simultaneously or separately), we ex...
Michel Gevers, Ljubisa Miskovic, Dominique Bonvin,...
This paper presents a new unified subdivision scheme that is defined over a k-simplicial complex in n-D space with k 3. We first present a series of definitions to facilitate top...