Sciweavers

405 search results - page 12 / 81
» Linking and Messaging from Real Paper in the Paper PDA
Sort
View
SPAA
2012
ACM
13 years 15 hour ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
AINTEC
2007
Springer
15 years 1 months ago
A Prototyping Environment for Wireless Multihop Networks
Relative to the impressive number of proposals addressing the multitude of challenges raised by IEEE 802.11-based wireless networks, few have known real implementation. In wireless...
Fehmi Ben Abdesslem, Luigi Iannone, Marcelo Dias d...
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
15 years 3 months ago
Efficient Closed Contour Extraction from Range Image's Edge Points
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
Angel Domingo Sappa
CIKM
2009
Springer
15 years 28 days ago
A framework for semantic link discovery over relational data
Discovering links between different data items in a single data source or across different data sources is a challenging problem faced by many information systems today. In partic...
Oktie Hassanzadeh, Anastasios Kementsietsidis, Lip...
ECOOP
2000
Springer
15 years 1 months ago
Automated Test Case Generation from Dynamic Models
We have recently shown how use cases can be systematically transformed into UML state charts considering all relevant information from a use case specification, including pre- and ...
Peter Fröhlich, Johannes Link