Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Recent years have witnessed a rapidly growing interest in query processing in sensor and actuator networks. This is mainly due to the increased awareness of query processing as th...
Michael Zoumboulakis, George Roussos, Alexandra Po...
With the increasing ubiquity of sensors and computational resources, it is becoming easier and increasingly common for people to electronically record, photographs, text, audio, a...
Abstract. We consider the question of how to establish and enforce communal policies for peer-to-peer (P2P) communities. Generally, members of each P2P community must conform to an...
Mihail F. Ionescu, Naftaly H. Minsky, Thu D. Nguye...
This paper addresses the issue of Web document summarization. As textual content of Web documents is often scarce or irrelevant and existing summarization techniques are based on ...