Sciweavers

1494 search results - page 253 / 299
» Polynomial time algorithms for network information flow
Sort
View
IWANN
2009
Springer
14 years 1 months ago
Stereo-MAS: Multi-Agent System for Image Stereo Processing
This article presents a distributed agent-based architecture that can process the visual information obtained by stereoscopic cameras. The system is embedded within a global projec...
Sara Rodríguez, Juan Francisco de Paz, Javi...
CCS
2007
ACM
14 years 21 days ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...
PERCOM
2011
ACM
13 years 12 days ago
Mobile node rostering in intermittently connected passive RFID networks
— This paper focuses on the problem of rostering in intermittently connected passive RFID networks. It aims to report a list of tagged mobile nodes that appear in given intereste...
Zhipeng Yang, Hongyi Wu
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 10 months ago
Progressive Distributed Top k Retrieval in Peer-to-Peer Networks
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
CIKM
2009
Springer
14 years 3 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...