We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
The Common Spatial Pattern (CSP) method is a powerful technique for feature extraction from multichannel neural activity and widely used in brain computer interface (BCI) applicat...
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...